31.11/16.10 YES 31.11/16.10 31.11/16.10 Ultimate: Cannot open display: 31.11/16.10 This is Ultimate 0.1.24-8dc7c08-m 31.11/16.10 [2019-03-28 12:44:30,446 INFO L170 SettingsManager]: Resetting all preferences to default values... 31.11/16.10 [2019-03-28 12:44:30,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 31.11/16.10 [2019-03-28 12:44:30,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 31.11/16.10 [2019-03-28 12:44:30,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 31.11/16.10 [2019-03-28 12:44:30,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 31.11/16.10 [2019-03-28 12:44:30,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 31.11/16.10 [2019-03-28 12:44:30,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 31.11/16.10 [2019-03-28 12:44:30,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 31.11/16.10 [2019-03-28 12:44:30,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 31.11/16.10 [2019-03-28 12:44:30,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 31.11/16.10 [2019-03-28 12:44:30,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 31.11/16.10 [2019-03-28 12:44:30,470 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 31.11/16.10 [2019-03-28 12:44:30,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 31.11/16.10 [2019-03-28 12:44:30,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 31.11/16.10 [2019-03-28 12:44:30,473 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 31.11/16.10 [2019-03-28 12:44:30,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 31.11/16.10 [2019-03-28 12:44:30,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 31.11/16.10 [2019-03-28 12:44:30,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 31.11/16.10 [2019-03-28 12:44:30,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 31.11/16.10 [2019-03-28 12:44:30,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 31.11/16.10 [2019-03-28 12:44:30,482 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 31.11/16.10 [2019-03-28 12:44:30,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 31.11/16.10 [2019-03-28 12:44:30,483 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 31.11/16.10 [2019-03-28 12:44:30,484 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 31.11/16.10 [2019-03-28 12:44:30,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 31.11/16.10 [2019-03-28 12:44:30,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 31.11/16.10 [2019-03-28 12:44:30,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 31.11/16.10 [2019-03-28 12:44:30,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,488 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 31.11/16.10 [2019-03-28 12:44:30,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 31.11/16.10 [2019-03-28 12:44:30,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 31.11/16.10 [2019-03-28 12:44:30,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 31.11/16.10 [2019-03-28 12:44:30,490 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 31.11/16.10 [2019-03-28 12:44:30,505 INFO L110 SettingsManager]: Loading preferences was successful 31.11/16.10 [2019-03-28 12:44:30,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 31.11/16.10 [2019-03-28 12:44:30,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 31.11/16.10 [2019-03-28 12:44:30,506 INFO L133 SettingsManager]: * Rewrite not-equals=true 31.11/16.10 [2019-03-28 12:44:30,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 31.11/16.10 [2019-03-28 12:44:30,507 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 31.11/16.10 [2019-03-28 12:44:30,507 INFO L133 SettingsManager]: * Use SBE=true 31.11/16.10 [2019-03-28 12:44:30,507 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 31.11/16.10 [2019-03-28 12:44:30,507 INFO L133 SettingsManager]: * Use old map elimination=false 31.11/16.10 [2019-03-28 12:44:30,507 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 31.11/16.10 [2019-03-28 12:44:30,508 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 31.11/16.10 [2019-03-28 12:44:30,508 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 31.11/16.10 [2019-03-28 12:44:30,508 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 31.11/16.10 [2019-03-28 12:44:30,508 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 31.11/16.11 [2019-03-28 12:44:30,508 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.11/16.11 [2019-03-28 12:44:30,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 31.11/16.11 [2019-03-28 12:44:30,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 31.11/16.11 [2019-03-28 12:44:30,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE 31.11/16.11 [2019-03-28 12:44:30,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 31.11/16.11 [2019-03-28 12:44:30,509 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 31.11/16.11 [2019-03-28 12:44:30,509 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 31.11/16.11 [2019-03-28 12:44:30,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 31.11/16.11 [2019-03-28 12:44:30,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 31.11/16.11 [2019-03-28 12:44:30,510 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 31.11/16.11 [2019-03-28 12:44:30,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.11/16.11 [2019-03-28 12:44:30,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 31.11/16.11 [2019-03-28 12:44:30,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 31.11/16.11 [2019-03-28 12:44:30,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 31.11/16.11 [2019-03-28 12:44:30,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 31.11/16.11 [2019-03-28 12:44:30,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 31.11/16.11 [2019-03-28 12:44:30,549 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 31.11/16.11 [2019-03-28 12:44:30,553 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 31.11/16.11 [2019-03-28 12:44:30,554 INFO L271 PluginConnector]: Initializing CDTParser... 31.11/16.11 [2019-03-28 12:44:30,555 INFO L276 PluginConnector]: CDTParser initialized 31.11/16.11 [2019-03-28 12:44:30,555 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 31.11/16.11 [2019-03-28 12:44:30,652 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/478954690db04d33a51d46b623dc7c53/FLAG49e856510 31.11/16.11 [2019-03-28 12:44:30,987 INFO L307 CDTParser]: Found 1 translation units. 31.11/16.11 [2019-03-28 12:44:30,988 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 31.11/16.11 [2019-03-28 12:44:30,988 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 31.11/16.11 [2019-03-28 12:44:30,995 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/478954690db04d33a51d46b623dc7c53/FLAG49e856510 31.11/16.11 [2019-03-28 12:44:31,388 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/478954690db04d33a51d46b623dc7c53 31.11/16.11 [2019-03-28 12:44:31,399 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 31.11/16.11 [2019-03-28 12:44:31,401 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 31.11/16.11 [2019-03-28 12:44:31,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 31.11/16.11 [2019-03-28 12:44:31,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 31.11/16.11 [2019-03-28 12:44:31,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 31.11/16.11 [2019-03-28 12:44:31,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36307006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:31,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 31.11/16.11 [2019-03-28 12:44:31,435 INFO L176 MainTranslator]: Built tables and reachable declarations 31.11/16.11 [2019-03-28 12:44:31,597 INFO L206 PostProcessor]: Analyzing one entry point: main 31.11/16.11 [2019-03-28 12:44:31,610 INFO L191 MainTranslator]: Completed pre-run 31.11/16.11 [2019-03-28 12:44:31,628 INFO L206 PostProcessor]: Analyzing one entry point: main 31.11/16.11 [2019-03-28 12:44:31,705 INFO L195 MainTranslator]: Completed translation 31.11/16.11 [2019-03-28 12:44:31,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31 WrapperNode 31.11/16.11 [2019-03-28 12:44:31,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 31.11/16.11 [2019-03-28 12:44:31,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 31.11/16.11 [2019-03-28 12:44:31,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 31.11/16.11 [2019-03-28 12:44:31,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 31.11/16.11 [2019-03-28 12:44:31,717 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:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,726 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:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 31.11/16.11 [2019-03-28 12:44:31,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 31.11/16.11 [2019-03-28 12:44:31,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 31.11/16.11 [2019-03-28 12:44:31,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized 31.11/16.11 [2019-03-28 12:44:31,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 [2019-03-28 12:44:31,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 31.11/16.11 [2019-03-28 12:44:31,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 31.11/16.11 [2019-03-28 12:44:31,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... 31.11/16.11 [2019-03-28 12:44:31,776 INFO L276 PluginConnector]: RCFGBuilder initialized 31.11/16.11 [2019-03-28 12:44:31,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (1/1) ... 31.11/16.11 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.11/16.11 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 31.11/16.11 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.11/16.11 [2019-03-28 12:44:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 31.11/16.11 [2019-03-28 12:44:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 31.11/16.11 [2019-03-28 12:44:31,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 31.11/16.11 [2019-03-28 12:44:31,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 31.11/16.11 [2019-03-28 12:44:31,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 31.11/16.11 [2019-03-28 12:44:31,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 31.11/16.11 [2019-03-28 12:44:32,157 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 31.11/16.11 [2019-03-28 12:44:32,158 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 31.11/16.11 [2019-03-28 12:44:32,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:32 BoogieIcfgContainer 31.11/16.11 [2019-03-28 12:44:32,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 31.11/16.11 [2019-03-28 12:44:32,160 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 31.11/16.11 [2019-03-28 12:44:32,160 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 31.11/16.11 [2019-03-28 12:44:32,162 INFO L276 PluginConnector]: BlockEncodingV2 initialized 31.11/16.11 [2019-03-28 12:44:32,163 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:32" (1/1) ... 31.11/16.11 [2019-03-28 12:44:32,180 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges 31.11/16.11 [2019-03-28 12:44:32,181 INFO L258 BlockEncoder]: Using Remove infeasible edges 31.11/16.11 [2019-03-28 12:44:32,182 INFO L263 BlockEncoder]: Using Maximize final states 31.11/16.11 [2019-03-28 12:44:32,183 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 31.11/16.11 [2019-03-28 12:44:32,183 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 31.11/16.11 [2019-03-28 12:44:32,185 INFO L296 BlockEncoder]: Using Remove sink states 31.11/16.11 [2019-03-28 12:44:32,186 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 31.11/16.11 [2019-03-28 12:44:32,186 INFO L179 BlockEncoder]: Using Rewrite not-equals 31.11/16.11 [2019-03-28 12:44:32,212 INFO L185 BlockEncoder]: Using Use SBE 31.11/16.11 [2019-03-28 12:44:32,251 INFO L200 BlockEncoder]: SBE split 25 edges 31.11/16.11 [2019-03-28 12:44:32,256 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 31.11/16.11 [2019-03-28 12:44:32,258 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.11/16.11 [2019-03-28 12:44:32,308 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 31.11/16.11 [2019-03-28 12:44:32,311 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 31.11/16.11 [2019-03-28 12:44:32,312 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 31.11/16.11 [2019-03-28 12:44:32,313 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.11/16.11 [2019-03-28 12:44:32,313 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 31.11/16.11 [2019-03-28 12:44:32,314 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 31.11/16.11 [2019-03-28 12:44:32,314 INFO L313 BlockEncoder]: Encoded RCFG 39 locations, 70 edges 31.11/16.11 [2019-03-28 12:44:32,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:32 BasicIcfg 31.11/16.11 [2019-03-28 12:44:32,315 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 31.11/16.11 [2019-03-28 12:44:32,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 31.11/16.11 [2019-03-28 12:44:32,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... 31.11/16.11 [2019-03-28 12:44:32,319 INFO L276 PluginConnector]: TraceAbstraction initialized 31.11/16.11 [2019-03-28 12:44:32,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:31" (1/4) ... 31.11/16.11 [2019-03-28 12:44:32,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4880c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:32, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:32,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (2/4) ... 31.11/16.11 [2019-03-28 12:44:32,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4880c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:32, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:32,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:32" (3/4) ... 31.11/16.11 [2019-03-28 12:44:32,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4880c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:32, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:32,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:32" (4/4) ... 31.11/16.11 [2019-03-28 12:44:32,324 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.11/16.11 [2019-03-28 12:44:32,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 31.11/16.11 [2019-03-28 12:44:32,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. 31.11/16.11 [2019-03-28 12:44:32,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. 31.11/16.11 [2019-03-28 12:44:32,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.11/16.11 [2019-03-28 12:44:32,389 INFO L382 AbstractCegarLoop]: Interprodecural is true 31.11/16.11 [2019-03-28 12:44:32,389 INFO L383 AbstractCegarLoop]: Hoare is true 31.11/16.11 [2019-03-28 12:44:32,389 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 31.11/16.11 [2019-03-28 12:44:32,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 31.11/16.11 [2019-03-28 12:44:32,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.11/16.11 [2019-03-28 12:44:32,389 INFO L387 AbstractCegarLoop]: Difference is false 31.11/16.11 [2019-03-28 12:44:32,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 31.11/16.11 [2019-03-28 12:44:32,390 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 31.11/16.11 [2019-03-28 12:44:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. 31.11/16.11 [2019-03-28 12:44:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.11/16.11 [2019-03-28 12:44:32,411 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:32,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.11/16.11 [2019-03-28 12:44:32,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:32,418 INFO L82 PathProgramCache]: Analyzing trace with hash 124423, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:32,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:32,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:32,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:32,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:32,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:32,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:32,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:32,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:32,610 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:32,772 INFO L93 Difference]: Finished difference Result 43 states and 70 transitions. 31.11/16.11 [2019-03-28 12:44:32,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:32,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.11/16.11 [2019-03-28 12:44:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:32,788 INFO L225 Difference]: With dead ends: 43 31.11/16.11 [2019-03-28 12:44:32,788 INFO L226 Difference]: Without dead ends: 39 31.11/16.11 [2019-03-28 12:44:32,792 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 31.11/16.11 [2019-03-28 12:44:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 31.11/16.11 [2019-03-28 12:44:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. 31.11/16.11 [2019-03-28 12:44:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 31.11/16.11 [2019-03-28 12:44:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. 31.11/16.11 [2019-03-28 12:44:32,833 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 3 31.11/16.11 [2019-03-28 12:44:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:32,834 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. 31.11/16.11 [2019-03-28 12:44:32,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. 31.11/16.11 [2019-03-28 12:44:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.11/16.11 [2019-03-28 12:44:32,835 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:32,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.11/16.11 [2019-03-28 12:44:32,836 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash 124424, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:32,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:32,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:32,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:32,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:32,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:32,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:32,893 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,007 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. 31.11/16.11 [2019-03-28 12:44:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.11/16.11 [2019-03-28 12:44:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,009 INFO L225 Difference]: With dead ends: 39 31.11/16.11 [2019-03-28 12:44:33,009 INFO L226 Difference]: Without dead ends: 35 31.11/16.11 [2019-03-28 12:44:33,010 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 31.11/16.11 [2019-03-28 12:44:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 31.11/16.11 [2019-03-28 12:44:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 31.11/16.11 [2019-03-28 12:44:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 31.11/16.11 [2019-03-28 12:44:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. 31.11/16.11 [2019-03-28 12:44:33,015 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 3 31.11/16.11 [2019-03-28 12:44:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,016 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. 31.11/16.11 [2019-03-28 12:44:33,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. 31.11/16.11 [2019-03-28 12:44:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.11/16.11 [2019-03-28 12:44:33,017 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:33,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,017 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash 124421, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:33,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:33,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:33,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:33,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:33,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:33,053 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,158 INFO L93 Difference]: Finished difference Result 35 states and 62 transitions. 31.11/16.11 [2019-03-28 12:44:33,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.11/16.11 [2019-03-28 12:44:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,159 INFO L225 Difference]: With dead ends: 35 31.11/16.11 [2019-03-28 12:44:33,160 INFO L226 Difference]: Without dead ends: 31 31.11/16.11 [2019-03-28 12:44:33,160 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 31.11/16.11 [2019-03-28 12:44:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 31.11/16.11 [2019-03-28 12:44:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 31.11/16.11 [2019-03-28 12:44:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 31.11/16.11 [2019-03-28 12:44:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. 31.11/16.11 [2019-03-28 12:44:33,165 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 31.11/16.11 [2019-03-28 12:44:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,165 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. 31.11/16.11 [2019-03-28 12:44:33,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. 31.11/16.11 [2019-03-28 12:44:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 31.11/16.11 [2019-03-28 12:44:33,166 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:33,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,166 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash 3855027, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:33,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:33,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:33,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:33,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:33,205 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,304 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. 31.11/16.11 [2019-03-28 12:44:33,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 31.11/16.11 [2019-03-28 12:44:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,305 INFO L225 Difference]: With dead ends: 31 31.11/16.11 [2019-03-28 12:44:33,305 INFO L226 Difference]: Without dead ends: 27 31.11/16.11 [2019-03-28 12:44:33,306 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 31.11/16.11 [2019-03-28 12:44:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 31.11/16.11 [2019-03-28 12:44:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 31.11/16.11 [2019-03-28 12:44:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 31.11/16.11 [2019-03-28 12:44:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. 31.11/16.11 [2019-03-28 12:44:33,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 4 31.11/16.11 [2019-03-28 12:44:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,310 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. 31.11/16.11 [2019-03-28 12:44:33,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. 31.11/16.11 [2019-03-28 12:44:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 31.11/16.11 [2019-03-28 12:44:33,311 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:33,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 3855029, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:33,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:33,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:33,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:33,346 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,444 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. 31.11/16.11 [2019-03-28 12:44:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 31.11/16.11 [2019-03-28 12:44:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,446 INFO L225 Difference]: With dead ends: 31 31.11/16.11 [2019-03-28 12:44:33,446 INFO L226 Difference]: Without dead ends: 27 31.11/16.11 [2019-03-28 12:44:33,447 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 31.11/16.11 [2019-03-28 12:44:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 31.11/16.11 [2019-03-28 12:44:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 31.11/16.11 [2019-03-28 12:44:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 31.11/16.11 [2019-03-28 12:44:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. 31.11/16.11 [2019-03-28 12:44:33,451 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 4 31.11/16.11 [2019-03-28 12:44:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,451 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. 31.11/16.11 [2019-03-28 12:44:33,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. 31.11/16.11 [2019-03-28 12:44:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 31.11/16.11 [2019-03-28 12:44:33,452 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:33,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,452 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 3855030, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:33,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:33,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:33,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:33,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:33,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:33,490 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,561 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. 31.11/16.11 [2019-03-28 12:44:33,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 31.11/16.11 [2019-03-28 12:44:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,562 INFO L225 Difference]: With dead ends: 27 31.11/16.11 [2019-03-28 12:44:33,562 INFO L226 Difference]: Without dead ends: 23 31.11/16.11 [2019-03-28 12:44: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 31.11/16.11 [2019-03-28 12:44:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 31.11/16.11 [2019-03-28 12:44:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 31.11/16.11 [2019-03-28 12:44:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 31.11/16.11 [2019-03-28 12:44:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. 31.11/16.11 [2019-03-28 12:44:33,567 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 4 31.11/16.11 [2019-03-28 12:44:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,567 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. 31.11/16.11 [2019-03-28 12:44:33,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. 31.11/16.11 [2019-03-28 12:44:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 31.11/16.11 [2019-03-28 12:44:33,568 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:33,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,568 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash 119504158, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:33,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:33,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:33,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:33,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:33,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:33,598 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,667 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. 31.11/16.11 [2019-03-28 12:44:33,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 31.11/16.11 [2019-03-28 12:44:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,668 INFO L225 Difference]: With dead ends: 23 31.11/16.11 [2019-03-28 12:44:33,668 INFO L226 Difference]: Without dead ends: 19 31.11/16.11 [2019-03-28 12:44:33,669 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 31.11/16.11 [2019-03-28 12:44:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 31.11/16.11 [2019-03-28 12:44:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 31.11/16.11 [2019-03-28 12:44:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 31.11/16.11 [2019-03-28 12:44:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. 31.11/16.11 [2019-03-28 12:44:33,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 5 31.11/16.11 [2019-03-28 12:44:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,673 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. 31.11/16.11 [2019-03-28 12:44:33,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. 31.11/16.11 [2019-03-28 12:44:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 31.11/16.11 [2019-03-28 12:44:33,673 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:33,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,674 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash 119504160, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:33,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:33,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:33,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:33,703 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,741 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. 31.11/16.11 [2019-03-28 12:44:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 31.11/16.11 [2019-03-28 12:44:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,742 INFO L225 Difference]: With dead ends: 23 31.11/16.11 [2019-03-28 12:44:33,742 INFO L226 Difference]: Without dead ends: 19 31.11/16.11 [2019-03-28 12:44:33,743 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 31.11/16.11 [2019-03-28 12:44:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 31.11/16.11 [2019-03-28 12:44:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 31.11/16.11 [2019-03-28 12:44:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 31.11/16.11 [2019-03-28 12:44:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. 31.11/16.11 [2019-03-28 12:44:33,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 5 31.11/16.11 [2019-03-28 12:44:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,746 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. 31.11/16.11 [2019-03-28 12:44:33,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. 31.11/16.11 [2019-03-28 12:44:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 31.11/16.11 [2019-03-28 12:44:33,747 INFO L394 BasicCegarLoop]: Found error trace 31.11/16.11 [2019-03-28 12:44:33,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,748 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 31.11/16.11 [2019-03-28 12:44:33,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,748 INFO L82 PathProgramCache]: Analyzing trace with hash 119504161, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:33,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/16.11 [2019-03-28 12:44:33,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/16.11 [2019-03-28 12:44:33,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/16.11 [2019-03-28 12:44:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/16.11 [2019-03-28 12:44:33,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/16.11 [2019-03-28 12:44:33,780 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. 31.11/16.11 [2019-03-28 12:44:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/16.11 [2019-03-28 12:44:33,825 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. 31.11/16.11 [2019-03-28 12:44:33,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 31.11/16.11 [2019-03-28 12:44:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/16.11 [2019-03-28 12:44:33,826 INFO L225 Difference]: With dead ends: 19 31.11/16.11 [2019-03-28 12:44:33,826 INFO L226 Difference]: Without dead ends: 0 31.11/16.11 [2019-03-28 12:44:33,826 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 31.11/16.11 [2019-03-28 12:44:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 31.11/16.11 [2019-03-28 12:44:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 31.11/16.11 [2019-03-28 12:44:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 31.11/16.11 [2019-03-28 12:44:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:33,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 31.11/16.11 [2019-03-28 12:44:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/16.11 [2019-03-28 12:44:33,828 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:33,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/16.11 [2019-03-28 12:44:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:33,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 31.11/16.11 [2019-03-28 12:44:33,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:33,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,865 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,865 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,865 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,866 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 17) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,866 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,866 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= (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_~tmp_ref~0.base)) (= ULTIMATE.start_test_fun_~tmp_ref~0.offset 0)) 31.11/16.11 [2019-03-28 12:44:33,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 17) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,868 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,869 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,869 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,869 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 31.11/16.11 [2019-03-28 12:44:33,869 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 31.11/16.11 [2019-03-28 12:44:33,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:33,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:33,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:33,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:33 BasicIcfg 31.11/16.11 [2019-03-28 12:44:33,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 31.11/16.11 [2019-03-28 12:44:33,890 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 31.11/16.11 [2019-03-28 12:44:33,890 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 31.11/16.11 [2019-03-28 12:44:33,893 INFO L276 PluginConnector]: BuchiAutomizer initialized 31.11/16.11 [2019-03-28 12:44:33,894 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/16.11 [2019-03-28 12:44:33,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:31" (1/5) ... 31.11/16.11 [2019-03-28 12:44:33,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fbf87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:33, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:33,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/16.11 [2019-03-28 12:44:33,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:31" (2/5) ... 31.11/16.11 [2019-03-28 12:44:33,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fbf87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:33, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:33,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/16.11 [2019-03-28 12:44:33,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:32" (3/5) ... 31.11/16.11 [2019-03-28 12:44:33,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fbf87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:33, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:33,896 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/16.11 [2019-03-28 12:44:33,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:32" (4/5) ... 31.11/16.11 [2019-03-28 12:44:33,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fbf87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:33, skipping insertion in model container 31.11/16.11 [2019-03-28 12:44:33,897 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/16.11 [2019-03-28 12:44:33,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:33" (5/5) ... 31.11/16.11 [2019-03-28 12:44:33,899 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.11/16.11 [2019-03-28 12:44:33,920 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.11/16.11 [2019-03-28 12:44:33,920 INFO L374 BuchiCegarLoop]: Interprodecural is true 31.11/16.11 [2019-03-28 12:44:33,921 INFO L375 BuchiCegarLoop]: Hoare is true 31.11/16.11 [2019-03-28 12:44:33,921 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 31.11/16.11 [2019-03-28 12:44:33,921 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 31.11/16.11 [2019-03-28 12:44:33,921 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.11/16.11 [2019-03-28 12:44:33,921 INFO L379 BuchiCegarLoop]: Difference is false 31.11/16.11 [2019-03-28 12:44:33,921 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 31.11/16.11 [2019-03-28 12:44:33,921 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 31.11/16.11 [2019-03-28 12:44:33,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. 31.11/16.11 [2019-03-28 12:44:33,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 31.11/16.11 [2019-03-28 12:44:33,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.11/16.11 [2019-03-28 12:44:33,932 INFO L119 BuchiIsEmpty]: Starting construction of run 31.11/16.11 [2019-03-28 12:44:33,936 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,936 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,936 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 31.11/16.11 [2019-03-28 12:44:33,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. 31.11/16.11 [2019-03-28 12:44:33,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 31.11/16.11 [2019-03-28 12:44:33,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.11/16.11 [2019-03-28 12:44:33,939 INFO L119 BuchiIsEmpty]: Starting construction of run 31.11/16.11 [2019-03-28 12:44:33,939 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,940 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.11/16.11 [2019-03-28 12:44:33,945 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [94] 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] 14#L-1true [141] 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~malloc2.base_1| |v_#StackHeapBarrier_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_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_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_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.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|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_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_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet11_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_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_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_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_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_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_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_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_main_#t~nondet11, 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~mem8, 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_~tmp, ULTIMATE.start_test_fun_#in~tmp, 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_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 15#L10true [72] 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] 28#L10-1true [87] 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] 34#L11true [95] L11-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3))) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) 1)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int] 30#L13-3true 31.11/16.11 [2019-03-28 12:44:33,946 INFO L796 eck$LassoCheckResult]: Loop: 30#L13-3true [91] 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] 37#L13true [101] 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] 36#L13-1true [100] 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] 21#L14true [80] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #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|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 19#L14-1true [191] L14-1-->L15: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12) (= (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16 (store (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 |v_ULTIMATE.start_test_fun_#t~mem5_6|)) |v_#memory_int_20|) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_21|, #length=|v_#length_30|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 23#L15true [84] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, 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_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, 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~mem6] 40#L15-1true [195] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~mem6_6|)) |v_#memory_int_25|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_34|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_34|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 7#L16true [63] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 4#L16-1true [196] L16-1-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_28| 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~mem7_6|)) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, 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, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, 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, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 30#L13-3true 31.11/16.11 [2019-03-28 12:44:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 119712640, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -510456228, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:33,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:33,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:33,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:33,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -5250627, now seen corresponding path program 1 times 31.11/16.11 [2019-03-28 12:44:34,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/16.11 [2019-03-28 12:44:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/16.11 [2019-03-28 12:44:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:34,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/16.11 [2019-03-28 12:44:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:34,619 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 31.11/16.11 [2019-03-28 12:44:34,810 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 89 31.11/16.11 [2019-03-28 12:44:34,824 INFO L216 LassoAnalysis]: Preferences: 31.11/16.11 [2019-03-28 12:44:34,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.11/16.11 [2019-03-28 12:44:34,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.11/16.11 [2019-03-28 12:44:34,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.11/16.11 [2019-03-28 12:44:34,826 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.11/16.11 [2019-03-28 12:44:34,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.11/16.11 [2019-03-28 12:44:34,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.11/16.11 [2019-03-28 12:44:34,826 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.11/16.11 [2019-03-28 12:44:34,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 31.11/16.11 [2019-03-28 12:44:34,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.11/16.11 [2019-03-28 12:44:34,827 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.11/16.11 [2019-03-28 12:44:34,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:34,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:35,242 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 31.11/16.11 [2019-03-28 12:44:35,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:35,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:35,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/16.11 [2019-03-28 12:44:35,780 INFO L300 LassoAnalysis]: Preprocessing complete. 31.11/16.11 [2019-03-28 12:44:35,786 INFO L497 LassoAnalysis]: Using template 'affine'. 31.11/16.11 [2019-03-28 12:44:35,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/16.11 [2019-03-28 12:44:35,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/16.11 [2019-03-28 12:44:35,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/16.11 [2019-03-28 12:44:35,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/16.11 [2019-03-28 12:44:35,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/16.11 [2019-03-28 12:44:35,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/16.11 [2019-03-28 12:44:35,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/16.11 [2019-03-28 12:44:35,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/16.11 Termination analysis: LINEAR_WITH_GUESSES 31.11/16.11 Number of strict supporting invariants: 0 31.11/16.11 Number of non-strict supporting invariants: 1 31.11/16.11 Consider only non-deceasing supporting invariants: true 31.11/16.11 Simplify termination arguments: true 31.11/16.11 Simplify supporting invariants: trueOverapproximate stem: false 31.11/16.11 [2019-03-28 12:44:35,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/16.11 [2019-03-28 12:44:35,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/16.11 [2019-03-28 12:44:35,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/16.11 [2019-03-28 12:44:35,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/16.11 [2019-03-28 12:44:35,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/16.11 [2019-03-28 12:44:35,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/16.11 [2019-03-28 12:44:35,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.11/16.11 [2019-03-28 12:44:35,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.11/16.11 [2019-03-28 12:44:35,956 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. 31.11/16.11 [2019-03-28 12:44:35,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.11/16.11 [2019-03-28 12:44:35,961 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 31.11/16.11 [2019-03-28 12:44:35,961 INFO L518 LassoAnalysis]: Proved termination. 31.11/16.11 [2019-03-28 12:44:35,961 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.11/16.11 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 31.11/16.11 Supporting invariants [] 31.11/16.11 [2019-03-28 12:44:36,063 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 31.11/16.11 [2019-03-28 12:44:36,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.11/16.11 [2019-03-28 12:44:36,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.11/16.11 [2019-03-28 12:44:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:36,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core 31.11/16.11 [2019-03-28 12:44:36,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/16.11 [2019-03-28 12:44:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:36,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjunts are in the unsatisfiable core 31.11/16.11 [2019-03-28 12:44:36,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/16.11 [2019-03-28 12:44:36,347 INFO L340 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size 31.11/16.11 [2019-03-28 12:44:36,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 68 31.11/16.11 [2019-03-28 12:44:36,356 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:36,394 INFO L497 ElimStorePlain]: treesize reduction 20, result has 74.4 percent of original size 31.11/16.11 [2019-03-28 12:44:36,395 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:36,395 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:58 31.11/16.11 [2019-03-28 12:44:36,479 INFO L172 IndexEqualityManager]: detected equality via solver 31.11/16.11 [2019-03-28 12:44:36,481 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/16.11 [2019-03-28 12:44:36,481 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 31.11/16.11 [2019-03-28 12:44:36,482 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:36,520 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/16.11 [2019-03-28 12:44:36,520 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 57 treesize of output 87 31.11/16.11 [2019-03-28 12:44:36,525 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:36,540 INFO L172 IndexEqualityManager]: detected equality via solver 31.11/16.11 [2019-03-28 12:44:36,541 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 31.11/16.11 [2019-03-28 12:44:36,542 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:36,575 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/16.11 [2019-03-28 12:44:36,576 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 4 case distinctions, treesize of input 57 treesize of output 87 31.11/16.11 [2019-03-28 12:44:36,581 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:36,722 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 31.11/16.11 [2019-03-28 12:44:36,723 INFO L497 ElimStorePlain]: treesize reduction 76, result has 67.7 percent of original size 31.11/16.11 [2019-03-28 12:44:36,724 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. 31.11/16.11 [2019-03-28 12:44:36,724 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:159 31.11/16.11 [2019-03-28 12:44:36,972 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 31.11/16.11 [2019-03-28 12:44:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:38,680 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/16.11 [2019-03-28 12:44:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:38,690 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/16.11 [2019-03-28 12:44:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:38,700 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/16.11 [2019-03-28 12:44:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:38,713 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/16.11 [2019-03-28 12:44:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:38,723 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/16.11 [2019-03-28 12:44:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/16.11 [2019-03-28 12:44:38,733 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/16.11 [2019-03-28 12:44:38,733 INFO L98 LoopCannibalizer]: 47 predicates before loop cannibalization 47 predicates after loop cannibalization 31.11/16.11 [2019-03-28 12:44:38,737 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 47 loop predicates 31.11/16.11 [2019-03-28 12:44:38,738 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states. Second operand 10 states. 31.11/16.11 [2019-03-28 12:44:41,719 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states.. Second operand 10 states. Result 121 states and 207 transitions. Complement of second has 35 states. 31.11/16.11 [2019-03-28 12:44:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 16 non-accepting loop states 2 accepting loop states 31.11/16.11 [2019-03-28 12:44:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 31.11/16.11 [2019-03-28 12:44:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. 31.11/16.11 [2019-03-28 12:44:41,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 163 transitions. Stem has 5 letters. Loop has 9 letters. 31.11/16.11 [2019-03-28 12:44:41,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/16.11 [2019-03-28 12:44:41,723 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted 31.11/16.11 [2019-03-28 12:44:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/16.11 [2019-03-28 12:44:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:41,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core 31.11/16.11 [2019-03-28 12:44:41,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/16.11 [2019-03-28 12:44:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/16.11 [2019-03-28 12:44:41,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjunts are in the unsatisfiable core 31.11/16.11 [2019-03-28 12:44:41,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/16.11 [2019-03-28 12:44:41,898 INFO L340 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size 31.11/16.11 [2019-03-28 12:44:41,899 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 68 31.11/16.11 [2019-03-28 12:44:41,903 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:41,944 INFO L497 ElimStorePlain]: treesize reduction 20, result has 74.4 percent of original size 31.11/16.11 [2019-03-28 12:44:41,945 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:41,945 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:58 31.11/16.11 [2019-03-28 12:44:42,041 INFO L172 IndexEqualityManager]: detected equality via solver 31.11/16.11 [2019-03-28 12:44:42,043 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 31.11/16.11 [2019-03-28 12:44:42,044 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:42,053 INFO L172 IndexEqualityManager]: detected equality via solver 31.11/16.11 [2019-03-28 12:44:42,055 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/16.11 [2019-03-28 12:44:42,055 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 31.11/16.11 [2019-03-28 12:44:42,056 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:42,097 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/16.11 [2019-03-28 12:44:42,098 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 57 treesize of output 87 31.11/16.11 [2019-03-28 12:44:42,102 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:42,140 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/16.11 [2019-03-28 12:44:42,140 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 4 case distinctions, treesize of input 57 treesize of output 87 31.11/16.11 [2019-03-28 12:44:42,144 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 31.11/16.11 [2019-03-28 12:44:42,268 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 31.11/16.11 [2019-03-28 12:44:42,268 INFO L497 ElimStorePlain]: treesize reduction 56, result has 74.0 percent of original size 31.11/16.11 [2019-03-28 12:44:42,269 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. 31.11/16.11 [2019-03-28 12:44:42,269 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:159 31.11/16.11 [2019-03-28 12:44:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/16.11 [2019-03-28 12:44:42,456 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates 31.11/16.11 [2019-03-28 12:44:42,456 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states. Second operand 10 states. 31.11/16.11 [2019-03-28 12:44:43,056 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 31.11/16.11 [2019-03-28 12:44:43,090 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states.. Second operand 10 states. Result 67 states and 125 transitions. Complement of second has 20 states. 31.11/16.11 [2019-03-28 12:44:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states 31.11/16.11 [2019-03-28 12:44:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 31.11/16.11 [2019-03-28 12:44:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. 31.11/16.11 [2019-03-28 12:44:43,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 117 transitions. Stem has 5 letters. Loop has 9 letters. 31.11/16.11 [2019-03-28 12:44:43,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/16.11 [2019-03-28 12:44:43,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 117 transitions. Stem has 14 letters. Loop has 9 letters. 31.11/16.11 [2019-03-28 12:44:43,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/16.11 [2019-03-28 12:44:43,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 117 transitions. Stem has 5 letters. Loop has 18 letters. 31.11/16.11 [2019-03-28 12:44:43,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/16.11 [2019-03-28 12:44:43,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 125 transitions. 31.11/16.11 [2019-03-28 12:44:43,108 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.11/16.11 [2019-03-28 12:44:43,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:43,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 31.11/16.11 [2019-03-28 12:44:43,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 31.11/16.11 [2019-03-28 12:44:43,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:43,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 31.11/16.11 [2019-03-28 12:44:43,111 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:43,111 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:43,111 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:43,111 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 31.11/16.11 [2019-03-28 12:44:43,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 31.11/16.11 [2019-03-28 12:44:43,112 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.11/16.11 [2019-03-28 12:44:43,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 31.11/16.11 [2019-03-28 12:44:43,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:43 BasicIcfg 31.11/16.11 [2019-03-28 12:44:43,118 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 31.11/16.11 [2019-03-28 12:44:43,118 INFO L168 Benchmark]: Toolchain (without parser) took 11718.30 ms. Allocated memory was 649.6 MB in the beginning and 856.2 MB in the end (delta: 206.6 MB). Free memory was 558.5 MB in the beginning and 450.3 MB in the end (delta: 108.2 MB). Peak memory consumption was 314.8 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,119 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. 31.11/16.11 [2019-03-28 12:44:43,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.22 ms. Allocated memory was 649.6 MB in the beginning and 658.0 MB in the end (delta: 8.4 MB). Free memory was 558.5 MB in the beginning and 625.2 MB in the end (delta: -66.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.41 ms. Allocated memory is still 658.0 MB. Free memory was 625.2 MB in the beginning and 622.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,120 INFO L168 Benchmark]: Boogie Preprocessor took 24.84 ms. Allocated memory is still 658.0 MB. Free memory was 622.1 MB in the beginning and 620.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,121 INFO L168 Benchmark]: RCFGBuilder took 383.86 ms. Allocated memory is still 658.0 MB. Free memory was 620.7 MB in the beginning and 594.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,122 INFO L168 Benchmark]: BlockEncodingV2 took 155.28 ms. Allocated memory is still 658.0 MB. Free memory was 594.6 MB in the beginning and 583.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,122 INFO L168 Benchmark]: TraceAbstraction took 1573.11 ms. Allocated memory is still 658.0 MB. Free memory was 583.7 MB in the beginning and 405.2 MB in the end (delta: 178.6 MB). Peak memory consumption was 178.6 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,123 INFO L168 Benchmark]: BuchiAutomizer took 9228.04 ms. Allocated memory was 658.0 MB in the beginning and 856.2 MB in the end (delta: 198.2 MB). Free memory was 405.2 MB in the beginning and 450.3 MB in the end (delta: -45.1 MB). Peak memory consumption was 153.1 MB. Max. memory is 50.3 GB. 31.11/16.11 [2019-03-28 12:44:43,127 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 31.11/16.11 --- Results --- 31.11/16.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 31.11/16.11 - StatisticsResult: Initial Icfg 31.11/16.11 47 locations, 48 edges 31.11/16.11 - StatisticsResult: Encoded RCFG 31.11/16.11 39 locations, 70 edges 31.11/16.11 * Results from de.uni_freiburg.informatik.ultimate.core: 31.11/16.11 - StatisticsResult: Toolchain Benchmarks 31.11/16.11 Benchmark results are: 31.11/16.11 * 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. 31.11/16.11 * CACSL2BoogieTranslator took 304.22 ms. Allocated memory was 649.6 MB in the beginning and 658.0 MB in the end (delta: 8.4 MB). Free memory was 558.5 MB in the beginning and 625.2 MB in the end (delta: -66.7 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. 31.11/16.11 * Boogie Procedure Inliner took 43.41 ms. Allocated memory is still 658.0 MB. Free memory was 625.2 MB in the beginning and 622.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 31.11/16.11 * Boogie Preprocessor took 24.84 ms. Allocated memory is still 658.0 MB. Free memory was 622.1 MB in the beginning and 620.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 31.11/16.11 * RCFGBuilder took 383.86 ms. Allocated memory is still 658.0 MB. Free memory was 620.7 MB in the beginning and 594.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. 31.11/16.11 * BlockEncodingV2 took 155.28 ms. Allocated memory is still 658.0 MB. Free memory was 594.6 MB in the beginning and 583.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 31.11/16.11 * TraceAbstraction took 1573.11 ms. Allocated memory is still 658.0 MB. Free memory was 583.7 MB in the beginning and 405.2 MB in the end (delta: 178.6 MB). Peak memory consumption was 178.6 MB. Max. memory is 50.3 GB. 31.11/16.11 * BuchiAutomizer took 9228.04 ms. Allocated memory was 658.0 MB in the beginning and 856.2 MB in the end (delta: 198.2 MB). Free memory was 405.2 MB in the beginning and 450.3 MB in the end (delta: -45.1 MB). Peak memory consumption was 153.1 MB. Max. memory is 50.3 GB. 31.11/16.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #length 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #length 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #length 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #length 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #length 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #length 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #memory_int 31.11/16.11 - GenericResult: Unfinished Backtranslation 31.11/16.11 unknown boogie variable #memory_int 31.11/16.11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 31.11/16.11 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 18]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 18]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 14]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 14]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 14]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 16]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 16]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 16]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 16]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 15]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 15]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 15]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 15]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 11]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 11]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - PositiveResult [Line: 14]: pointer dereference always succeeds 31.11/16.11 For all program executions holds that pointer dereference always succeeds at this location 31.11/16.11 - AllSpecificationsHoldResult: All specifications hold 31.11/16.11 24 specifications checked. All of them hold 31.11/16.11 - InvariantResult [Line: 12]: Loop Invariant 31.11/16.11 [2019-03-28 12:44:43,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:43,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:43,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:43,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:43,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 [2019-03-28 12:44:43,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/16.11 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && 1 == \valid[tmp_ref]) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[tmp_ref]) && tmp_ref == 0 31.11/16.11 - StatisticsResult: Ultimate Automizer benchmark data 31.11/16.11 CFG has 1 procedures, 39 locations, 24 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 296 SDslu, 6 SDs, 0 SdLazy, 349 SolverSat, 102 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=39occurred 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 31.11/16.11 - StatisticsResult: Constructed decomposition of program 31.11/16.11 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 11 locations. 31.11/16.11 - StatisticsResult: Timing statistics 31.11/16.11 BüchiAutomizer plugin needed 9.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 1.8s. Büchi inclusion checks took 5.1s. 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 [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 1047 SDslu, 182 SDs, 0 SdLazy, 2734 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital420 mio100 ax100 hnf100 lsp97 ukn43 mio100 lsp39 div100 bol100 ite100 ukn100 eq179 hnf88 smp97 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 31.11/16.11 - TerminationAnalysisResult: Termination proven 31.11/16.11 Buchi Automizer proved that your program is terminating 31.11/16.11 RESULT: Ultimate proved your program to be correct! 31.11/16.11 !SESSION 2019-03-28 12:44:28.119 ----------------------------------------------- 31.11/16.11 eclipse.buildId=unknown 31.11/16.11 java.version=1.8.0_181 31.11/16.11 java.vendor=Oracle Corporation 31.11/16.11 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 31.11/16.11 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 31.11/16.11 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 31.11/16.11 31.11/16.11 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:43.372 31.11/16.11 !MESSAGE The workspace will exit with unsaved changes in this session. 31.11/16.11 Received shutdown request... 31.11/16.11 Ultimate: 31.11/16.11 GTK+ Version Check 31.11/16.11 EOF