37.42/24.69 YES 37.42/24.69 37.42/24.69 Ultimate: Cannot open display: 37.42/24.69 This is Ultimate 0.1.24-8dc7c08-m 37.42/24.69 [2019-03-28 12:45:30,362 INFO L170 SettingsManager]: Resetting all preferences to default values... 37.42/24.69 [2019-03-28 12:45:30,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 37.42/24.69 [2019-03-28 12:45:30,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 37.42/24.69 [2019-03-28 12:45:30,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 37.42/24.69 [2019-03-28 12:45:30,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 37.42/24.69 [2019-03-28 12:45:30,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 37.42/24.69 [2019-03-28 12:45:30,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 37.42/24.69 [2019-03-28 12:45:30,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 37.42/24.69 [2019-03-28 12:45:30,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 37.42/24.69 [2019-03-28 12:45:30,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 37.42/24.69 [2019-03-28 12:45:30,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 37.42/24.69 [2019-03-28 12:45:30,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 37.42/24.69 [2019-03-28 12:45:30,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 37.42/24.69 [2019-03-28 12:45:30,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 37.42/24.69 [2019-03-28 12:45:30,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 37.42/24.69 [2019-03-28 12:45:30,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 37.42/24.69 [2019-03-28 12:45:30,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 37.42/24.69 [2019-03-28 12:45:30,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 37.42/24.69 [2019-03-28 12:45:30,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 37.42/24.69 [2019-03-28 12:45:30,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 37.42/24.69 [2019-03-28 12:45:30,398 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 37.42/24.69 [2019-03-28 12:45:30,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 37.42/24.69 [2019-03-28 12:45:30,399 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 37.42/24.69 [2019-03-28 12:45:30,400 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 37.42/24.69 [2019-03-28 12:45:30,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 37.42/24.69 [2019-03-28 12:45:30,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 37.42/24.69 [2019-03-28 12:45:30,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 37.42/24.69 [2019-03-28 12:45:30,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 37.42/24.69 [2019-03-28 12:45:30,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 37.42/24.69 [2019-03-28 12:45:30,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 37.42/24.69 [2019-03-28 12:45:30,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 37.42/24.69 [2019-03-28 12:45:30,406 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 37.42/24.69 [2019-03-28 12:45:30,420 INFO L110 SettingsManager]: Loading preferences was successful 37.42/24.69 [2019-03-28 12:45:30,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 37.42/24.69 [2019-03-28 12:45:30,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 37.42/24.69 [2019-03-28 12:45:30,422 INFO L133 SettingsManager]: * Rewrite not-equals=true 37.42/24.69 [2019-03-28 12:45:30,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 37.42/24.69 [2019-03-28 12:45:30,422 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 37.42/24.69 [2019-03-28 12:45:30,422 INFO L133 SettingsManager]: * Use SBE=true 37.42/24.69 [2019-03-28 12:45:30,423 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 37.42/24.69 [2019-03-28 12:45:30,423 INFO L133 SettingsManager]: * Use old map elimination=false 37.42/24.69 [2019-03-28 12:45:30,423 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 37.42/24.69 [2019-03-28 12:45:30,423 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 37.42/24.69 [2019-03-28 12:45:30,423 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 37.42/24.69 [2019-03-28 12:45:30,423 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 37.42/24.69 [2019-03-28 12:45:30,424 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 37.42/24.69 [2019-03-28 12:45:30,424 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 37.42/24.69 [2019-03-28 12:45:30,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 37.42/24.69 [2019-03-28 12:45:30,424 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 37.42/24.69 [2019-03-28 12:45:30,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE 37.42/24.69 [2019-03-28 12:45:30,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 37.42/24.69 [2019-03-28 12:45:30,425 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 37.42/24.69 [2019-03-28 12:45:30,425 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 37.42/24.69 [2019-03-28 12:45:30,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 37.42/24.69 [2019-03-28 12:45:30,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 37.42/24.69 [2019-03-28 12:45:30,425 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 37.42/24.69 [2019-03-28 12:45:30,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 37.42/24.69 [2019-03-28 12:45:30,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 37.42/24.69 [2019-03-28 12:45:30,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 37.42/24.69 [2019-03-28 12:45:30,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 37.42/24.69 [2019-03-28 12:45:30,426 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 37.42/24.69 [2019-03-28 12:45:30,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 37.42/24.69 [2019-03-28 12:45:30,465 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 37.42/24.69 [2019-03-28 12:45:30,469 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 37.42/24.69 [2019-03-28 12:45:30,470 INFO L271 PluginConnector]: Initializing CDTParser... 37.42/24.69 [2019-03-28 12:45:30,470 INFO L276 PluginConnector]: CDTParser initialized 37.42/24.69 [2019-03-28 12:45:30,471 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 37.42/24.69 [2019-03-28 12:45:30,575 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/4a0475ad8cbe489a8c7dc59afbc0bd04/FLAG69f794719 37.42/24.69 [2019-03-28 12:45:30,906 INFO L307 CDTParser]: Found 1 translation units. 37.42/24.69 [2019-03-28 12:45:30,907 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 37.42/24.69 [2019-03-28 12:45:30,907 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 37.42/24.69 [2019-03-28 12:45:30,914 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/4a0475ad8cbe489a8c7dc59afbc0bd04/FLAG69f794719 37.42/24.70 [2019-03-28 12:45:31,317 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/4a0475ad8cbe489a8c7dc59afbc0bd04 37.42/24.70 [2019-03-28 12:45:31,328 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 37.42/24.70 [2019-03-28 12:45:31,330 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 37.42/24.70 [2019-03-28 12:45:31,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 37.42/24.70 [2019-03-28 12:45:31,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 37.42/24.70 [2019-03-28 12:45:31,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 37.42/24.70 [2019-03-28 12:45:31,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525b0348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:31,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 37.42/24.70 [2019-03-28 12:45:31,364 INFO L176 MainTranslator]: Built tables and reachable declarations 37.42/24.70 [2019-03-28 12:45:31,527 INFO L206 PostProcessor]: Analyzing one entry point: main 37.42/24.70 [2019-03-28 12:45:31,540 INFO L191 MainTranslator]: Completed pre-run 37.42/24.70 [2019-03-28 12:45:31,558 INFO L206 PostProcessor]: Analyzing one entry point: main 37.42/24.70 [2019-03-28 12:45:31,637 INFO L195 MainTranslator]: Completed translation 37.42/24.70 [2019-03-28 12:45:31,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31 WrapperNode 37.42/24.70 [2019-03-28 12:45:31,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 37.42/24.70 [2019-03-28 12:45:31,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 37.42/24.70 [2019-03-28 12:45:31,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 37.42/24.70 [2019-03-28 12:45:31,639 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 37.42/24.70 [2019-03-28 12:45:31,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 37.42/24.70 [2019-03-28 12:45:31,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 37.42/24.70 [2019-03-28 12:45:31,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 37.42/24.70 [2019-03-28 12:45:31,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized 37.42/24.70 [2019-03-28 12:45:31,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 [2019-03-28 12:45:31,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 37.42/24.70 [2019-03-28 12:45:31,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 37.42/24.70 [2019-03-28 12:45:31,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... 37.42/24.70 [2019-03-28 12:45:31,708 INFO L276 PluginConnector]: RCFGBuilder initialized 37.42/24.70 [2019-03-28 12:45:31,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (1/1) ... 37.42/24.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 37.42/24.70 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 37.42/24.70 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 37.42/24.70 [2019-03-28 12:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 37.42/24.70 [2019-03-28 12:45:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 37.42/24.70 [2019-03-28 12:45:31,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 37.42/24.70 [2019-03-28 12:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 37.42/24.70 [2019-03-28 12:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 37.42/24.70 [2019-03-28 12:45:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 37.42/24.70 [2019-03-28 12:45:32,045 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 37.42/24.70 [2019-03-28 12:45:32,046 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 37.42/24.70 [2019-03-28 12:45:32,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:32 BoogieIcfgContainer 37.42/24.70 [2019-03-28 12:45:32,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 37.42/24.70 [2019-03-28 12:45:32,048 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 37.42/24.70 [2019-03-28 12:45:32,048 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 37.42/24.70 [2019-03-28 12:45:32,050 INFO L276 PluginConnector]: BlockEncodingV2 initialized 37.42/24.70 [2019-03-28 12:45:32,051 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:32" (1/1) ... 37.42/24.70 [2019-03-28 12:45:32,068 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 41 edges 37.42/24.70 [2019-03-28 12:45:32,069 INFO L258 BlockEncoder]: Using Remove infeasible edges 37.42/24.70 [2019-03-28 12:45:32,070 INFO L263 BlockEncoder]: Using Maximize final states 37.42/24.70 [2019-03-28 12:45:32,071 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 37.42/24.70 [2019-03-28 12:45:32,071 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 37.42/24.70 [2019-03-28 12:45:32,073 INFO L296 BlockEncoder]: Using Remove sink states 37.42/24.70 [2019-03-28 12:45:32,073 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 37.42/24.70 [2019-03-28 12:45:32,074 INFO L179 BlockEncoder]: Using Rewrite not-equals 37.42/24.70 [2019-03-28 12:45:32,097 INFO L185 BlockEncoder]: Using Use SBE 37.42/24.70 [2019-03-28 12:45:32,138 INFO L200 BlockEncoder]: SBE split 21 edges 37.42/24.70 [2019-03-28 12:45:32,143 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 37.42/24.70 [2019-03-28 12:45:32,145 INFO L71 MaximizeFinalStates]: 0 new accepting states 37.42/24.70 [2019-03-28 12:45:32,178 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 37.42/24.70 [2019-03-28 12:45:32,180 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 37.42/24.70 [2019-03-28 12:45:32,182 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 37.42/24.70 [2019-03-28 12:45:32,182 INFO L71 MaximizeFinalStates]: 0 new accepting states 37.42/24.70 [2019-03-28 12:45:32,183 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 37.42/24.70 [2019-03-28 12:45:32,183 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 37.42/24.70 [2019-03-28 12:45:32,184 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 60 edges 37.42/24.70 [2019-03-28 12:45:32,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:32 BasicIcfg 37.42/24.70 [2019-03-28 12:45:32,184 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 37.42/24.70 [2019-03-28 12:45:32,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 37.42/24.70 [2019-03-28 12:45:32,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... 37.42/24.70 [2019-03-28 12:45:32,189 INFO L276 PluginConnector]: TraceAbstraction initialized 37.42/24.70 [2019-03-28 12:45:32,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:45:31" (1/4) ... 37.42/24.70 [2019-03-28 12:45:32,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1d760f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:32, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:32,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (2/4) ... 37.42/24.70 [2019-03-28 12:45:32,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1d760f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:45:32, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:32,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:32" (3/4) ... 37.42/24.70 [2019-03-28 12:45:32,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1d760f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:32, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:32,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:32" (4/4) ... 37.42/24.70 [2019-03-28 12:45:32,193 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 37.42/24.70 [2019-03-28 12:45:32,203 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 37.42/24.70 [2019-03-28 12:45:32,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 37.42/24.70 [2019-03-28 12:45:32,230 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 37.42/24.70 [2019-03-28 12:45:32,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation 37.42/24.70 [2019-03-28 12:45:32,260 INFO L382 AbstractCegarLoop]: Interprodecural is true 37.42/24.70 [2019-03-28 12:45:32,260 INFO L383 AbstractCegarLoop]: Hoare is true 37.42/24.70 [2019-03-28 12:45:32,260 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 37.42/24.70 [2019-03-28 12:45:32,261 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 37.42/24.70 [2019-03-28 12:45:32,261 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 37.42/24.70 [2019-03-28 12:45:32,261 INFO L387 AbstractCegarLoop]: Difference is false 37.42/24.70 [2019-03-28 12:45:32,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 37.42/24.70 [2019-03-28 12:45:32,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 37.42/24.70 [2019-03-28 12:45:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. 37.42/24.70 [2019-03-28 12:45:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 37.42/24.70 [2019-03-28 12:45:32,283 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:32,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 37.42/24.70 [2019-03-28 12:45:32,284 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash 111352, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:32,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:32,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:32,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:32,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:32,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:32,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:32,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:32,502 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:32,657 INFO L93 Difference]: Finished difference Result 33 states and 60 transitions. 37.42/24.70 [2019-03-28 12:45:32,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:32,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 37.42/24.70 [2019-03-28 12:45:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:32,673 INFO L225 Difference]: With dead ends: 33 37.42/24.70 [2019-03-28 12:45:32,673 INFO L226 Difference]: Without dead ends: 31 37.42/24.70 [2019-03-28 12:45:32,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 37.42/24.70 [2019-03-28 12:45:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 37.42/24.70 [2019-03-28 12:45:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 37.42/24.70 [2019-03-28 12:45:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. 37.42/24.70 [2019-03-28 12:45:32,717 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 3 37.42/24.70 [2019-03-28 12:45:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:32,719 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 56 transitions. 37.42/24.70 [2019-03-28 12:45:32,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. 37.42/24.70 [2019-03-28 12:45:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 37.42/24.70 [2019-03-28 12:45:32,719 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:32,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 37.42/24.70 [2019-03-28 12:45:32,720 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash 111354, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:32,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:32,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:32,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:32,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:32,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:32,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:32,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:32,751 INFO L87 Difference]: Start difference. First operand 31 states and 56 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:32,835 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. 37.42/24.70 [2019-03-28 12:45:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:32,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 37.42/24.70 [2019-03-28 12:45:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:32,837 INFO L225 Difference]: With dead ends: 33 37.42/24.70 [2019-03-28 12:45:32,837 INFO L226 Difference]: Without dead ends: 31 37.42/24.70 [2019-03-28 12:45:32,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 37.42/24.70 [2019-03-28 12:45:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 37.42/24.70 [2019-03-28 12:45:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 37.42/24.70 [2019-03-28 12:45:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. 37.42/24.70 [2019-03-28 12:45:32,843 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 37.42/24.70 [2019-03-28 12:45:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:32,843 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. 37.42/24.70 [2019-03-28 12:45:32,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. 37.42/24.70 [2019-03-28 12:45:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 37.42/24.70 [2019-03-28 12:45:32,844 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:32,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 37.42/24.70 [2019-03-28 12:45:32,844 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:32,845 INFO L82 PathProgramCache]: Analyzing trace with hash 111355, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:32,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:32,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:32,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:32,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:32,886 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:33,001 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. 37.42/24.70 [2019-03-28 12:45:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 37.42/24.70 [2019-03-28 12:45:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:33,003 INFO L225 Difference]: With dead ends: 31 37.42/24.70 [2019-03-28 12:45:33,003 INFO L226 Difference]: Without dead ends: 29 37.42/24.70 [2019-03-28 12:45:33,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 37.42/24.70 [2019-03-28 12:45:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 37.42/24.70 [2019-03-28 12:45:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 37.42/24.70 [2019-03-28 12:45:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. 37.42/24.70 [2019-03-28 12:45:33,008 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 3 37.42/24.70 [2019-03-28 12:45:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:33,008 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 52 transitions. 37.42/24.70 [2019-03-28 12:45:33,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 52 transitions. 37.42/24.70 [2019-03-28 12:45:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 37.42/24.70 [2019-03-28 12:45:33,009 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:33,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,009 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:33,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash 3449963, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:33,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:33,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:33,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,054 INFO L87 Difference]: Start difference. First operand 29 states and 52 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:33,137 INFO L93 Difference]: Finished difference Result 29 states and 52 transitions. 37.42/24.70 [2019-03-28 12:45:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 37.42/24.70 [2019-03-28 12:45:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:33,138 INFO L225 Difference]: With dead ends: 29 37.42/24.70 [2019-03-28 12:45:33,138 INFO L226 Difference]: Without dead ends: 25 37.42/24.70 [2019-03-28 12:45:33,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 37.42/24.70 [2019-03-28 12:45:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 37.42/24.70 [2019-03-28 12:45:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 37.42/24.70 [2019-03-28 12:45:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. 37.42/24.70 [2019-03-28 12:45:33,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 4 37.42/24.70 [2019-03-28 12:45:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:33,143 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. 37.42/24.70 [2019-03-28 12:45:33,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. 37.42/24.70 [2019-03-28 12:45:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 37.42/24.70 [2019-03-28 12:45:33,144 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:33,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,144 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,145 INFO L82 PathProgramCache]: Analyzing trace with hash 3449965, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:33,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:33,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:33,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,176 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:33,267 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. 37.42/24.70 [2019-03-28 12:45:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 37.42/24.70 [2019-03-28 12:45:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:33,268 INFO L225 Difference]: With dead ends: 29 37.42/24.70 [2019-03-28 12:45:33,269 INFO L226 Difference]: Without dead ends: 25 37.42/24.70 [2019-03-28 12:45:33,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 37.42/24.70 [2019-03-28 12:45:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 37.42/24.70 [2019-03-28 12:45:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 37.42/24.70 [2019-03-28 12:45:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. 37.42/24.70 [2019-03-28 12:45:33,273 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 4 37.42/24.70 [2019-03-28 12:45:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:33,273 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. 37.42/24.70 [2019-03-28 12:45:33,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. 37.42/24.70 [2019-03-28 12:45:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 37.42/24.70 [2019-03-28 12:45:33,274 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:33,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,275 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:33,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,275 INFO L82 PathProgramCache]: Analyzing trace with hash 3449966, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:33,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:33,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:33,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,316 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:33,384 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. 37.42/24.70 [2019-03-28 12:45:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 37.42/24.70 [2019-03-28 12:45:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:33,385 INFO L225 Difference]: With dead ends: 25 37.42/24.70 [2019-03-28 12:45:33,385 INFO L226 Difference]: Without dead ends: 21 37.42/24.70 [2019-03-28 12:45:33,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 37.42/24.70 [2019-03-28 12:45:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 37.42/24.70 [2019-03-28 12:45:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 37.42/24.70 [2019-03-28 12:45:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. 37.42/24.70 [2019-03-28 12:45:33,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 37.42/24.70 [2019-03-28 12:45:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:33,390 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. 37.42/24.70 [2019-03-28 12:45:33,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. 37.42/24.70 [2019-03-28 12:45:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 37.42/24.70 [2019-03-28 12:45:33,391 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:33,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,391 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash 106947311, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:33,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:33,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:33,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:33,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:33,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,427 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:33,483 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 37.42/24.70 [2019-03-28 12:45:33,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 37.42/24.70 [2019-03-28 12:45:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:33,485 INFO L225 Difference]: With dead ends: 21 37.42/24.70 [2019-03-28 12:45:33,485 INFO L226 Difference]: Without dead ends: 17 37.42/24.70 [2019-03-28 12:45:33,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 37.42/24.70 [2019-03-28 12:45:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 37.42/24.70 [2019-03-28 12:45:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 37.42/24.70 [2019-03-28 12:45:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. 37.42/24.70 [2019-03-28 12:45:33,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 37.42/24.70 [2019-03-28 12:45:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:33,489 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. 37.42/24.70 [2019-03-28 12:45:33,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. 37.42/24.70 [2019-03-28 12:45:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 37.42/24.70 [2019-03-28 12:45:33,489 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:33,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash 106947313, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:33,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:33,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:33,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,516 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:33,561 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. 37.42/24.70 [2019-03-28 12:45:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 37.42/24.70 [2019-03-28 12:45:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:33,563 INFO L225 Difference]: With dead ends: 21 37.42/24.70 [2019-03-28 12:45:33,563 INFO L226 Difference]: Without dead ends: 17 37.42/24.70 [2019-03-28 12:45:33,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 37.42/24.70 [2019-03-28 12:45:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 37.42/24.70 [2019-03-28 12:45:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 37.42/24.70 [2019-03-28 12:45:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. 37.42/24.70 [2019-03-28 12:45:33,567 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 5 37.42/24.70 [2019-03-28 12:45:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:33,567 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. 37.42/24.70 [2019-03-28 12:45:33,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. 37.42/24.70 [2019-03-28 12:45:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 37.42/24.70 [2019-03-28 12:45:33,568 INFO L394 BasicCegarLoop]: Found error trace 37.42/24.70 [2019-03-28 12:45:33,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,568 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 37.42/24.70 [2019-03-28 12:45:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 106947314, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:33,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.42/24.70 [2019-03-28 12:45:33,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.42/24.70 [2019-03-28 12:45:33,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.42/24.70 [2019-03-28 12:45:33,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.42/24.70 [2019-03-28 12:45:33,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,603 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. 37.42/24.70 [2019-03-28 12:45:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.42/24.70 [2019-03-28 12:45:33,646 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. 37.42/24.70 [2019-03-28 12:45:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 37.42/24.70 [2019-03-28 12:45:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.42/24.70 [2019-03-28 12:45:33,647 INFO L225 Difference]: With dead ends: 17 37.42/24.70 [2019-03-28 12:45:33,647 INFO L226 Difference]: Without dead ends: 0 37.42/24.70 [2019-03-28 12:45:33,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.42/24.70 [2019-03-28 12:45:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 37.42/24.70 [2019-03-28 12:45:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 37.42/24.70 [2019-03-28 12:45:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 37.42/24.70 [2019-03-28 12:45:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:33,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 37.42/24.70 [2019-03-28 12:45:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. 37.42/24.70 [2019-03-28 12:45:33,649 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:33,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.42/24.70 [2019-03-28 12:45:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:33,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 37.42/24.70 [2019-03-28 12:45:33,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:33,685 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,685 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,685 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,685 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,685 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,686 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,686 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,686 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,687 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 16) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,687 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,687 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 16) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 37.42/24.70 [2019-03-28 12:45:33,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,688 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 16) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,689 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,689 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,690 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,690 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,690 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,690 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,690 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 37.42/24.70 [2019-03-28 12:45:33,691 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 37.42/24.70 [2019-03-28 12:45:33,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:33,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:33,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:33,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:33,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:33,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:33,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:33 BasicIcfg 37.42/24.70 [2019-03-28 12:45:33,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 37.42/24.70 [2019-03-28 12:45:33,711 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 37.42/24.70 [2019-03-28 12:45:33,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 37.42/24.70 [2019-03-28 12:45:33,714 INFO L276 PluginConnector]: BuchiAutomizer initialized 37.42/24.70 [2019-03-28 12:45:33,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.42/24.70 [2019-03-28 12:45:33,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:45:31" (1/5) ... 37.42/24.70 [2019-03-28 12:45:33,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7fd0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:33, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:33,716 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.42/24.70 [2019-03-28 12:45:33,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:45:31" (2/5) ... 37.42/24.70 [2019-03-28 12:45:33,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7fd0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:45:33, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:33,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.42/24.70 [2019-03-28 12:45:33,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:45:32" (3/5) ... 37.42/24.70 [2019-03-28 12:45:33,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7fd0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:33, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:33,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.42/24.70 [2019-03-28 12:45:33,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:45:32" (4/5) ... 37.42/24.70 [2019-03-28 12:45:33,718 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7fd0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:33, skipping insertion in model container 37.42/24.70 [2019-03-28 12:45:33,718 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.42/24.70 [2019-03-28 12:45:33,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:45:33" (5/5) ... 37.42/24.70 [2019-03-28 12:45:33,719 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 37.42/24.70 [2019-03-28 12:45:33,741 INFO L133 ementStrategyFactory]: Using default assertion order modulation 37.42/24.70 [2019-03-28 12:45:33,741 INFO L374 BuchiCegarLoop]: Interprodecural is true 37.42/24.70 [2019-03-28 12:45:33,741 INFO L375 BuchiCegarLoop]: Hoare is true 37.42/24.70 [2019-03-28 12:45:33,741 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 37.42/24.70 [2019-03-28 12:45:33,742 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 37.42/24.70 [2019-03-28 12:45:33,742 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 37.42/24.70 [2019-03-28 12:45:33,742 INFO L379 BuchiCegarLoop]: Difference is false 37.42/24.70 [2019-03-28 12:45:33,742 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 37.42/24.70 [2019-03-28 12:45:33,742 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 37.42/24.70 [2019-03-28 12:45:33,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 37.42/24.70 [2019-03-28 12:45:33,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 37.42/24.70 [2019-03-28 12:45:33,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 37.42/24.70 [2019-03-28 12:45:33,752 INFO L119 BuchiIsEmpty]: Starting construction of run 37.42/24.70 [2019-03-28 12:45:33,757 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,757 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,757 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 37.42/24.70 [2019-03-28 12:45:33,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 37.42/24.70 [2019-03-28 12:45:33,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 37.42/24.70 [2019-03-28 12:45:33,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 37.42/24.70 [2019-03-28 12:45:33,759 INFO L119 BuchiIsEmpty]: Starting construction of run 37.42/24.70 [2019-03-28 12:45:33,759 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,760 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 37.42/24.70 [2019-03-28 12:45:33,765 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [81] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [123] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet8_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret10, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 11#L10true [57] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 24#L10-1true [74] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 29#L11true [82] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 26#L13-3true 37.42/24.70 [2019-03-28 12:45:33,766 INFO L796 eck$LassoCheckResult]: Loop: 26#L13-3true [78] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 32#L13true [87] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 30#L13-1true [86] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 17#L14true [66] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 16#L14-1true [165] L14-1-->L15: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (= (store |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem5_6| 1))) |v_#memory_int_17|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_17|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 19#L15true [69] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 34#L15-1true [169] L15-1-->L13-3: Formula: (and (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (store |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| 1))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 26#L13-3true 37.42/24.70 [2019-03-28 12:45:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash 107155798, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 525939443, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash 626321406, now seen corresponding path program 1 times 37.42/24.70 [2019-03-28 12:45:33,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.42/24.70 [2019-03-28 12:45:33,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.42/24.70 [2019-03-28 12:45:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.42/24.70 [2019-03-28 12:45:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:34,344 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 37.42/24.70 [2019-03-28 12:45:34,457 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 37.42/24.70 [2019-03-28 12:45:34,471 INFO L216 LassoAnalysis]: Preferences: 37.42/24.70 [2019-03-28 12:45:34,472 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 37.42/24.70 [2019-03-28 12:45:34,473 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 37.42/24.70 [2019-03-28 12:45:34,473 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 37.42/24.70 [2019-03-28 12:45:34,473 INFO L127 ssoRankerPreferences]: Use exernal solver: false 37.42/24.70 [2019-03-28 12:45:34,473 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 37.42/24.70 [2019-03-28 12:45:34,473 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 37.42/24.70 [2019-03-28 12:45:34,473 INFO L130 ssoRankerPreferences]: Path of dumped script: 37.42/24.70 [2019-03-28 12:45:34,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 37.42/24.70 [2019-03-28 12:45:34,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 37.42/24.70 [2019-03-28 12:45:34,474 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 37.42/24.70 [2019-03-28 12:45:34,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,834 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 37.42/24.70 [2019-03-28 12:45:34,957 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 37.42/24.70 [2019-03-28 12:45:34,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:34,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.42/24.70 [2019-03-28 12:45:35,360 INFO L300 LassoAnalysis]: Preprocessing complete. 37.42/24.70 [2019-03-28 12:45:35,365 INFO L497 LassoAnalysis]: Using template 'affine'. 37.42/24.70 [2019-03-28 12:45:35,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 37.42/24.70 [2019-03-28 12:45:35,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 37.42/24.70 [2019-03-28 12:45:35,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.42/24.70 [2019-03-28 12:45:35,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.42/24.70 Termination analysis: LINEAR_WITH_GUESSES 37.42/24.70 Number of strict supporting invariants: 0 37.42/24.70 Number of non-strict supporting invariants: 1 37.42/24.70 Consider only non-deceasing supporting invariants: true 37.42/24.70 Simplify termination arguments: true 37.42/24.70 Simplify supporting invariants: trueOverapproximate stem: false 37.42/24.70 [2019-03-28 12:45:35,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.42/24.70 [2019-03-28 12:45:35,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.42/24.70 [2019-03-28 12:45:35,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.42/24.70 [2019-03-28 12:45:35,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.42/24.70 [2019-03-28 12:45:35,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.42/24.70 [2019-03-28 12:45:35,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.42/24.70 [2019-03-28 12:45:35,482 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 37.42/24.70 [2019-03-28 12:45:35,494 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 37.42/24.70 [2019-03-28 12:45:35,494 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 37.42/24.70 [2019-03-28 12:45:35,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 37.42/24.70 [2019-03-28 12:45:35,499 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 37.42/24.70 [2019-03-28 12:45:35,499 INFO L518 LassoAnalysis]: Proved termination. 37.42/24.70 [2019-03-28 12:45:35,499 INFO L520 LassoAnalysis]: Termination argument consisting of: 37.42/24.70 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 37.42/24.70 Supporting invariants [] 37.42/24.70 [2019-03-28 12:45:35,587 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 37.42/24.70 [2019-03-28 12:45:35,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 37.42/24.70 [2019-03-28 12:45:35,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 37.42/24.70 [2019-03-28 12:45:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.42/24.70 [2019-03-28 12:45:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:35,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core 37.42/24.70 [2019-03-28 12:45:35,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... 37.42/24.70 [2019-03-28 12:45:35,682 INFO L189 IndexEqualityManager]: detected not equals via solver 37.42/24.70 [2019-03-28 12:45:35,699 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 37.42/24.70 [2019-03-28 12:45:35,699 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 37.42/24.70 [2019-03-28 12:45:35,707 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 37.42/24.70 [2019-03-28 12:45:35,708 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 37.42/24.70 [2019-03-28 12:45:35,708 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 37.42/24.70 [2019-03-28 12:45:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:35,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core 37.42/24.70 [2019-03-28 12:45:35,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... 37.42/24.70 [2019-03-28 12:45:35,859 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 37.42/24.70 [2019-03-28 12:45:35,860 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 37.42/24.70 [2019-03-28 12:45:35,872 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 37.42/24.70 [2019-03-28 12:45:35,907 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 37.42/24.70 [2019-03-28 12:45:35,909 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 37.42/24.70 [2019-03-28 12:45:35,909 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 37.42/24.70 [2019-03-28 12:45:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.42/24.70 [2019-03-28 12:45:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:36,150 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 37.42/24.70 [2019-03-28 12:45:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:36,160 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 37.42/24.70 [2019-03-28 12:45:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.42/24.70 [2019-03-28 12:45:36,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core 37.42/24.70 [2019-03-28 12:45:36,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... 37.42/24.70 [2019-03-28 12:45:36,238 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 37.42/24.70 [2019-03-28 12:45:36,238 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 37.42/24.70 [2019-03-28 12:45:36,253 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 37.42/24.70 [2019-03-28 12:45:36,314 INFO L497 ElimStorePlain]: treesize reduction 85, result has 38.4 percent of original size 37.42/24.70 [2019-03-28 12:45:36,316 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 37.42/24.70 [2019-03-28 12:45:36,316 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 37.42/24.70 [2019-03-28 12:45:45,788 WARN L188 SmtUtils]: Spent 3.66 s on a formula simplification that was a NOOP. DAG size: 31 37.42/24.70 [2019-03-28 12:45:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.42/24.70 [2019-03-28 12:45:45,877 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 37.42/24.70 [2019-03-28 12:45:45,877 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 13 predicates after loop cannibalization 37.42/24.70 [2019-03-28 12:45:45,882 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 13 loop predicates 37.42/24.70 [2019-03-28 12:45:45,883 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states. Second operand 9 states. 37.42/24.70 [2019-03-28 12:45:51,606 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states.. Second operand 9 states. Result 144 states and 245 transitions. Complement of second has 43 states. 37.42/24.70 [2019-03-28 12:45:51,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 3 stem states 9 non-accepting loop states 2 accepting loop states 37.42/24.70 [2019-03-28 12:45:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 37.42/24.70 [2019-03-28 12:45:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 165 transitions. 37.42/24.70 [2019-03-28 12:45:51,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 7 letters. 37.42/24.70 [2019-03-28 12:45:51,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. 37.42/24.70 [2019-03-28 12:45:51,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 12 letters. Loop has 7 letters. 37.42/24.70 [2019-03-28 12:45:51,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. 37.42/24.70 [2019-03-28 12:45:51,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 14 letters. 37.42/24.70 [2019-03-28 12:45:51,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. 37.42/24.70 [2019-03-28 12:45:51,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 245 transitions. 37.42/24.70 [2019-03-28 12:45:51,631 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 37.42/24.70 [2019-03-28 12:45:51,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:51,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 37.42/24.70 [2019-03-28 12:45:51,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 37.42/24.70 [2019-03-28 12:45:51,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:51,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 37.42/24.70 [2019-03-28 12:45:51,633 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:51,633 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:51,634 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:51,634 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 37.42/24.70 [2019-03-28 12:45:51,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 37.42/24.70 [2019-03-28 12:45:51,634 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 37.42/24.70 [2019-03-28 12:45:51,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 37.42/24.70 [2019-03-28 12:45:51,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:51 BasicIcfg 37.42/24.70 [2019-03-28 12:45:51,640 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 37.42/24.70 [2019-03-28 12:45:51,641 INFO L168 Benchmark]: Toolchain (without parser) took 20312.19 ms. Allocated memory was 649.6 MB in the beginning and 771.8 MB in the end (delta: 122.2 MB). Free memory was 558.4 MB in the beginning and 492.6 MB in the end (delta: 65.8 MB). Peak memory consumption was 187.9 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,643 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.93 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 558.4 MB in the beginning and 652.1 MB in the end (delta: -93.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.18 ms. Allocated memory is still 684.7 MB. Free memory was 652.1 MB in the beginning and 649.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,645 INFO L168 Benchmark]: Boogie Preprocessor took 24.50 ms. Allocated memory is still 684.7 MB. Free memory was 649.0 MB in the beginning and 646.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,645 INFO L168 Benchmark]: RCFGBuilder took 340.00 ms. Allocated memory is still 684.7 MB. Free memory was 646.3 MB in the beginning and 622.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,646 INFO L168 Benchmark]: BlockEncodingV2 took 136.83 ms. Allocated memory is still 684.7 MB. Free memory was 622.7 MB in the beginning and 613.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,646 INFO L168 Benchmark]: TraceAbstraction took 1525.01 ms. Allocated memory is still 684.7 MB. Free memory was 611.9 MB in the beginning and 444.0 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,647 INFO L168 Benchmark]: BuchiAutomizer took 17929.45 ms. Allocated memory was 684.7 MB in the beginning and 771.8 MB in the end (delta: 87.0 MB). Free memory was 444.0 MB in the beginning and 492.6 MB in the end (delta: -48.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 50.3 GB. 37.42/24.70 [2019-03-28 12:45:51,651 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 37.42/24.70 --- Results --- 37.42/24.70 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 37.42/24.70 - StatisticsResult: Initial Icfg 37.42/24.70 40 locations, 41 edges 37.42/24.70 - StatisticsResult: Encoded RCFG 37.42/24.70 33 locations, 60 edges 37.42/24.70 * Results from de.uni_freiburg.informatik.ultimate.core: 37.42/24.70 - StatisticsResult: Toolchain Benchmarks 37.42/24.70 Benchmark results are: 37.42/24.70 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 37.42/24.70 * CACSL2BoogieTranslator took 307.93 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 558.4 MB in the beginning and 652.1 MB in the end (delta: -93.7 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. 37.42/24.70 * Boogie Procedure Inliner took 43.18 ms. Allocated memory is still 684.7 MB. Free memory was 652.1 MB in the beginning and 649.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 37.42/24.70 * Boogie Preprocessor took 24.50 ms. Allocated memory is still 684.7 MB. Free memory was 649.0 MB in the beginning and 646.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 37.42/24.70 * RCFGBuilder took 340.00 ms. Allocated memory is still 684.7 MB. Free memory was 646.3 MB in the beginning and 622.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 37.42/24.70 * BlockEncodingV2 took 136.83 ms. Allocated memory is still 684.7 MB. Free memory was 622.7 MB in the beginning and 613.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 37.42/24.70 * TraceAbstraction took 1525.01 ms. Allocated memory is still 684.7 MB. Free memory was 611.9 MB in the beginning and 444.0 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 50.3 GB. 37.42/24.70 * BuchiAutomizer took 17929.45 ms. Allocated memory was 684.7 MB in the beginning and 771.8 MB in the end (delta: 87.0 MB). Free memory was 444.0 MB in the beginning and 492.6 MB in the end (delta: -48.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 50.3 GB. 37.42/24.70 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #length 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #length 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #length 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #length 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #length 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #length 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #memory_int 37.42/24.70 - GenericResult: Unfinished Backtranslation 37.42/24.70 unknown boogie variable #memory_int 37.42/24.70 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 37.42/24.70 - PositiveResult [Line: 11]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 10]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 10]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 11]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 17]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 17]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.42/24.70 For all program executions holds that pointer dereference always succeeds at this location 37.42/24.70 - AllSpecificationsHoldResult: All specifications hold 37.42/24.70 20 specifications checked. All of them hold 37.42/24.70 - InvariantResult [Line: 12]: Loop Invariant 37.42/24.70 [2019-03-28 12:45:51,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:51,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:51,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:51,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:51,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 [2019-03-28 12:45:51,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.42/24.70 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 37.42/24.70 - StatisticsResult: Ultimate Automizer benchmark data 37.42/24.70 CFG has 1 procedures, 33 locations, 20 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 264 SDslu, 6 SDs, 0 SdLazy, 321 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 37.42/24.70 - StatisticsResult: Constructed decomposition of program 37.42/24.70 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 14 locations. 37.42/24.70 - StatisticsResult: Timing statistics 37.42/24.70 BüchiAutomizer plugin needed 17.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. Büchi inclusion checks took 15.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 446 SDslu, 52 SDs, 0 SdLazy, 544 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax100 hnf100 lsp98 ukn60 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 37.42/24.70 - TerminationAnalysisResult: Termination proven 37.42/24.70 Buchi Automizer proved that your program is terminating 37.42/24.70 RESULT: Ultimate proved your program to be correct! 37.42/24.70 !SESSION 2019-03-28 12:45:28.029 ----------------------------------------------- 37.42/24.70 eclipse.buildId=unknown 37.42/24.70 java.version=1.8.0_181 37.42/24.70 java.vendor=Oracle Corporation 37.42/24.70 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 37.42/24.70 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 37.42/24.70 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 37.42/24.70 37.42/24.70 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:45:51.889 37.42/24.70 !MESSAGE The workspace will exit with unsaved changes in this session. 37.42/24.70 Received shutdown request... 37.42/24.70 Ultimate: 37.42/24.70 GTK+ Version Check 37.42/24.70 EOF