./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3cd0186843eb184a03f25fecfe7ca0b9c84c33a9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:45:41,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:45:41,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:45:41,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:45:41,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:45:41,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:45:41,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:45:41,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:45:41,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:45:41,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:45:41,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:45:41,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:45:41,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:45:41,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:45:41,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:45:41,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:45:41,470 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:45:41,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:45:41,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:45:41,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:45:41,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:45:41,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:45:41,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:45:41,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:45:41,477 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:45:41,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:45:41,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:45:41,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:45:41,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:45:41,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:45:41,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:45:41,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:45:41,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:45:41,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:45:41,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:45:41,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:45:41,483 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:45:41,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:45:41,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:45:41,494 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:45:41,494 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:45:41,495 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:45:41,495 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:45:41,495 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:45:41,495 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:45:41,495 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:45:41,495 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:45:41,496 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:45:41,496 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:45:41,496 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:45:41,496 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:45:41,496 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:45:41,496 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:45:41,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:45:41,496 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:45:41,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:45:41,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:45:41,497 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:45:41,497 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:45:41,497 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:45:41,497 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:45:41,497 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:45:41,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:45:41,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:45:41,498 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:45:41,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:45:41,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:45:41,498 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:45:41,499 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:45:41,499 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cd0186843eb184a03f25fecfe7ca0b9c84c33a9 [2018-11-23 06:45:41,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:45:41,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:45:41,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:45:41,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:45:41,532 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:45:41,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-23 06:45:41,570 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/data/b5efb5ba4/e3fd4acc8adb462284ac55d143d8046d/FLAG9ed6670e2 [2018-11-23 06:45:41,964 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:45:41,964 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-23 06:45:41,968 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/data/b5efb5ba4/e3fd4acc8adb462284ac55d143d8046d/FLAG9ed6670e2 [2018-11-23 06:45:41,980 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/data/b5efb5ba4/e3fd4acc8adb462284ac55d143d8046d [2018-11-23 06:45:41,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:45:41,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:45:41,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:45:41,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:45:41,986 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:45:41,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:45:41" (1/1) ... [2018-11-23 06:45:41,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5db597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:41, skipping insertion in model container [2018-11-23 06:45:41,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:45:41" (1/1) ... [2018-11-23 06:45:41,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:45:42,014 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:45:42,128 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:45:42,134 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:45:42,147 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:45:42,158 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:45:42,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42 WrapperNode [2018-11-23 06:45:42,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:45:42,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:45:42,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:45:42,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:45:42,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:45:42,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:45:42,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:45:42,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:45:42,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... [2018-11-23 06:45:42,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:45:42,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:45:42,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:45:42,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:45:42,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:45:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:45:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:45:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:45:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:45:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:45:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:45:42,437 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:45:42,438 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 06:45:42,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:45:42 BoogieIcfgContainer [2018-11-23 06:45:42,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:45:42,439 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:45:42,439 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:45:42,441 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:45:42,442 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:45:42,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:45:41" (1/3) ... [2018-11-23 06:45:42,442 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f1c1535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:45:42, skipping insertion in model container [2018-11-23 06:45:42,442 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:45:42,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:45:42" (2/3) ... [2018-11-23 06:45:42,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f1c1535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:45:42, skipping insertion in model container [2018-11-23 06:45:42,443 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:45:42,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:45:42" (3/3) ... [2018-11-23 06:45:42,444 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg05_true-unreach-call_true-termination.i [2018-11-23 06:45:42,481 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:45:42,481 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:45:42,481 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:45:42,482 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:45:42,482 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:45:42,482 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:45:42,482 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:45:42,482 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:45:42,482 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:45:42,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-23 06:45:42,506 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 06:45:42,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:42,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:42,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:45:42,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:42,510 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:45:42,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-23 06:45:42,511 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 06:45:42,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:42,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:42,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:45:42,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:42,517 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2018-11-23 06:45:42,518 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2018-11-23 06:45:42,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 06:45:42,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:42,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:42,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 06:45:42,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:42,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:42,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:42,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 06:45:42,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:42,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:42,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:42,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:42,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:42,724 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:45:42,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:45:42,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:45:42,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:45:42,725 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:45:42,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:45:42,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:45:42,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:45:42,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 06:45:42,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:45:42,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:45:42,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:42,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:45:42,959 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:45:42,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:42,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:42,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:42,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:42,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:42,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:42,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:42,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:42,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:42,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:42,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:42,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:42,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:42,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:42,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:42,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:42,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:42,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:42,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:42,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:42,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:42,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:42,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:42,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:42,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:42,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:42,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:42,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:42,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:42,997 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:45:42,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:42,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:42,999 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:45:42,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:43,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:43,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:43,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:43,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:43,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:43,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:43,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:43,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:43,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:45:43,060 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:45:43,060 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 06:45:43,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:45:43,063 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:45:43,064 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:45:43,064 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-23 06:45:43,075 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 06:45:43,085 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:45:43,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,157 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:45:43,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-11-23 06:45:43,214 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 66 states and 92 transitions. Complement of second has 8 states. [2018-11-23 06:45:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:45:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:45:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 06:45:43,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 06:45:43,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:45:43,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 06:45:43,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:45:43,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 06:45:43,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:45:43,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2018-11-23 06:45:43,221 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2018-11-23 06:45:43,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 06:45:43,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:45:43,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-23 06:45:43,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:43,226 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 06:45:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-23 06:45:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 06:45:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 06:45:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-23 06:45:43,244 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 06:45:43,244 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 06:45:43,244 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:45:43,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-23 06:45:43,244 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:43,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:43,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 06:45:43,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:43,245 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 145#L23-3 assume !(main_~i~1 < 5); 144#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 137#L9-3 [2018-11-23 06:45:43,245 INFO L796 eck$LassoCheckResult]: Loop: 137#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 138#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 137#L9-3 [2018-11-23 06:45:43,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 06:45:43,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:43,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:45:43,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:45:43,273 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:43,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-11-23 06:45:43,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:43,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:45:43,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:45:43,300 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 06:45:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:43,308 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 06:45:43,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:45:43,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-23 06:45:43,309 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-11-23 06:45:43,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:45:43,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:45:43,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-23 06:45:43,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:43,310 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 06:45:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-23 06:45:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 06:45:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 06:45:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-23 06:45:43,311 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 06:45:43,312 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 06:45:43,312 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:45:43,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-23 06:45:43,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:43,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:43,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:45:43,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:43,313 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 192#L23-3 assume !(main_~i~1 < 5); 189#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 182#L9-3 [2018-11-23 06:45:43,313 INFO L796 eck$LassoCheckResult]: Loop: 182#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 183#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 182#L9-3 [2018-11-23 06:45:43,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 06:45:43,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:43,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:43,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:43,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:43,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 06:45:43,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:43,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-11-23 06:45:43,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:45:43,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:45:43,400 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 06:45:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:43,411 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 06:45:43,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:45:43,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-23 06:45:43,411 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-11-23 06:45:43,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:45:43,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:45:43,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-23 06:45:43,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:43,413 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-23 06:45:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-23 06:45:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 06:45:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 06:45:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-23 06:45:43,414 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 06:45:43,415 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 06:45:43,415 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:45:43,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-23 06:45:43,415 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:43,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:43,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 06:45:43,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:43,416 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 254#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 256#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 264#L23-3 assume !(main_~i~1 < 5); 253#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 246#L9-3 [2018-11-23 06:45:43,416 INFO L796 eck$LassoCheckResult]: Loop: 246#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 247#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 246#L9-3 [2018-11-23 06:45:43,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-23 06:45:43,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:43,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:43,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:45:43,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:45:43,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:45:43,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:43,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 06:45:43,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:43,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-11-23 06:45:43,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:45:43,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:45:43,544 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-23 06:45:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:43,561 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 06:45:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:45:43,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-23 06:45:43,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 06:45:43,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:45:43,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:45:43,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-23 06:45:43,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:43,563 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 06:45:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-23 06:45:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 06:45:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 06:45:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 06:45:43,565 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 06:45:43,565 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 06:45:43,565 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:45:43,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-23 06:45:43,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:43,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:43,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-23 06:45:43,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:43,566 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 329#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 330#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 331#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 340#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 339#L23-3 assume !(main_~i~1 < 5); 328#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 321#L9-3 [2018-11-23 06:45:43,566 INFO L796 eck$LassoCheckResult]: Loop: 321#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 322#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 321#L9-3 [2018-11-23 06:45:43,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-23 06:45:43,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:43,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:43,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:45:43,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 06:45:43,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:45:43,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:43,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 06:45:43,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:43,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-11-23 06:45:43,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:45:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:45:43,668 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 06:45:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:43,681 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 06:45:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:45:43,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-11-23 06:45:43,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 06:45:43,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:45:43,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:45:43,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-23 06:45:43,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:43,683 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 06:45:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-23 06:45:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 06:45:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 06:45:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 06:45:43,684 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 06:45:43,684 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 06:45:43,684 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:45:43,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-23 06:45:43,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:43,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:43,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-23 06:45:43,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:43,685 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 415#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 417#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 420#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 427#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 426#L23-3 assume !(main_~i~1 < 5); 414#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 407#L9-3 [2018-11-23 06:45:43,685 INFO L796 eck$LassoCheckResult]: Loop: 407#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 408#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 407#L9-3 [2018-11-23 06:45:43,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,685 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-23 06:45:43,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:43,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:43,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:45:43,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:45:43,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:45:43,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:43,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:43,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 06:45:43,765 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:43,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-11-23 06:45:43,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:45:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:45:43,792 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-23 06:45:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:43,816 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 06:45:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:45:43,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-23 06:45:43,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 06:45:43,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 06:45:43,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:45:43,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-23 06:45:43,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:43,819 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 06:45:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-23 06:45:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 06:45:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 06:45:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 06:45:43,820 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 06:45:43,821 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 06:45:43,821 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:45:43,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 06:45:43,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 06:45:43,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:43,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:43,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-23 06:45:43,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:43,822 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 516#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 526#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 524#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 523#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 522#L23-3 assume !(main_~i~1 < 5); 510#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 503#L9-3 [2018-11-23 06:45:43,822 INFO L796 eck$LassoCheckResult]: Loop: 503#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 504#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 503#L9-3 [2018-11-23 06:45:43,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-23 06:45:43,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-11-23 06:45:43,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:43,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2018-11-23 06:45:43,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:43,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:43,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:44,170 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-23 06:45:44,233 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:45:44,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:45:44,233 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:45:44,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:45:44,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:45:44,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:45:44,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:45:44,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:45:44,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 06:45:44,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:45:44,234 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:45:44,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:45:44,505 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:45:44,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:45:44,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:44,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:44,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:44,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:45:44,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:45:44,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:45:44,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:44,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:44,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,550 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:45:44,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,551 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:45:44,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:44,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:45:44,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:45:44,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:45:44,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:45:44,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:45:44,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:45:44,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:45:44,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:45:44,578 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:45:44,591 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:45:44,591 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:45:44,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:45:44,592 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:45:44,592 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:45:44,592 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0) = -2*ULTIMATE.start_avg_~i~0 + 9 Supporting invariants [] [2018-11-23 06:45:44,613 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 06:45:44,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:44,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:44,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:45:44,650 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:45:44,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 06:45:44,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2018-11-23 06:45:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:45:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:45:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 06:45:44,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 06:45:44,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:45:44,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-23 06:45:44,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:45:44,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 06:45:44,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:45:44,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-23 06:45:44,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:44,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2018-11-23 06:45:44,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 06:45:44,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 06:45:44,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-11-23 06:45:44,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:44,667 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 06:45:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-11-23 06:45:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 06:45:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 06:45:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 06:45:44,668 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 06:45:44,668 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 06:45:44,668 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 06:45:44,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-23 06:45:44,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:44,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:44,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:44,669 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:45:44,669 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:44,670 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 658#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 654#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 655#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 656#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 657#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 659#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 670#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 669#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 668#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 667#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 666#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 665#L23-3 assume !(main_~i~1 < 5); 653#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 645#L9-3 assume !(avg_~i~0 < 5); 643#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 644#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 663#L9-8 [2018-11-23 06:45:44,670 INFO L796 eck$LassoCheckResult]: Loop: 663#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 664#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 663#L9-8 [2018-11-23 06:45:44,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2018-11-23 06:45:44,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:44,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 06:45:44,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:45:44,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:45:44,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:44,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2018-11-23 06:45:44,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:44,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:45:44,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:45:44,736 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 06:45:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:44,755 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 06:45:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:45:44,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-11-23 06:45:44,757 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:44,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 06:45:44,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 06:45:44,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 06:45:44,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-23 06:45:44,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:44,758 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 06:45:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-23 06:45:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-23 06:45:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 06:45:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 06:45:44,759 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 06:45:44,759 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 06:45:44,759 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 06:45:44,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-23 06:45:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:44,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:44,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:44,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:45:44,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:44,761 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 721#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 722#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 723#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 724#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 738#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 737#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 736#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 734#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 733#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 732#L23-3 assume !(main_~i~1 < 5); 720#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 712#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 713#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 714#L9-3 assume !(avg_~i~0 < 5); 710#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 711#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 729#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 730#L9-7 [2018-11-23 06:45:44,761 INFO L796 eck$LassoCheckResult]: Loop: 730#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 731#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 730#L9-7 [2018-11-23 06:45:44,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:44,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2018-11-23 06:45:44,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:44,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:44,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:44,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 06:45:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:44,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:44,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 06:45:44,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:44,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 06:45:44,862 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:44,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2018-11-23 06:45:44,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:44,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:44,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:44,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:44,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:45:44,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:45:44,891 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 06:45:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:44,917 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 06:45:44,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:45:44,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2018-11-23 06:45:44,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:44,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 06:45:44,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 06:45:44,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 06:45:44,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2018-11-23 06:45:44,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:44,919 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 06:45:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2018-11-23 06:45:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-23 06:45:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 06:45:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 06:45:44,921 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 06:45:44,921 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 06:45:44,921 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 06:45:44,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2018-11-23 06:45:44,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:44,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:44,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:44,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:45:44,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:44,922 INFO L794 eck$LassoCheckResult]: Stem: 861#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 860#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 856#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 857#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 858#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 875#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 873#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 871#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 870#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 869#L23-3 assume !(main_~i~1 < 5); 855#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 845#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 846#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 847#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 848#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 852#L9-3 assume !(avg_~i~0 < 5); 843#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 844#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 866#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 867#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 864#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 865#L9-7 [2018-11-23 06:45:44,922 INFO L796 eck$LassoCheckResult]: Loop: 865#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 868#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 865#L9-7 [2018-11-23 06:45:44,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2018-11-23 06:45:44,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:44,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 06:45:44,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:44,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:44,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:44,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 06:45:45,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:45,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 06:45:45,017 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:45,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2018-11-23 06:45:45,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:45,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:45:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:45:45,039 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-23 06:45:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:45,068 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 06:45:45,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:45:45,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2018-11-23 06:45:45,069 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:45,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 06:45:45,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 06:45:45,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 06:45:45,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2018-11-23 06:45:45,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:45,070 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 06:45:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2018-11-23 06:45:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-11-23 06:45:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 06:45:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 06:45:45,072 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 06:45:45,072 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 06:45:45,072 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 06:45:45,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-23 06:45:45,073 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:45,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:45,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:45,073 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:45:45,073 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:45,073 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1016#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1012#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1013#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1033#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1028#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1027#L23-3 assume !(main_~i~1 < 5); 1011#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1001#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1002#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1003#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1004#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1008#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1026#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1025#L9-3 assume !(avg_~i~0 < 5); 999#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1000#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1022#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1023#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1024#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1035#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1020#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1021#L9-7 [2018-11-23 06:45:45,074 INFO L796 eck$LassoCheckResult]: Loop: 1021#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1032#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1021#L9-7 [2018-11-23 06:45:45,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2018-11-23 06:45:45,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 06:45:45,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:45,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:45,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:45:45,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:45:45,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:45:45,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 06:45:45,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:45,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 06:45:45,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:45,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2018-11-23 06:45:45,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:45:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:45:45,182 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 06:45:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:45,224 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 06:45:45,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:45:45,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2018-11-23 06:45:45,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:45,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 06:45:45,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-23 06:45:45,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-23 06:45:45,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2018-11-23 06:45:45,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:45,227 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 06:45:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2018-11-23 06:45:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-11-23 06:45:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 06:45:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 06:45:45,229 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 06:45:45,229 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 06:45:45,229 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 06:45:45,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2018-11-23 06:45:45,229 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:45,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:45,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:45,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:45:45,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:45,230 INFO L794 eck$LassoCheckResult]: Stem: 1197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1194#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1211#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1210#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1206#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1205#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1204#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1203#L23-3 assume !(main_~i~1 < 5); 1189#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1180#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1181#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1182#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1183#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1214#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1213#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1212#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1202#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1201#L9-3 assume !(avg_~i~0 < 5); 1178#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1179#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1198#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1199#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1200#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1218#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1217#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1216#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1215#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1209#L9-7 [2018-11-23 06:45:45,231 INFO L796 eck$LassoCheckResult]: Loop: 1209#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1208#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1209#L9-7 [2018-11-23 06:45:45,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2018-11-23 06:45:45,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 06:45:45,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:45:45,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22bb5c41-24a7-4e67-b4c3-d01c8d62de4d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:45:45,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:45:45,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 06:45:45,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:45:45,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:45:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 06:45:45,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:45:45,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 06:45:45,348 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:45:45,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2018-11-23 06:45:45,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:45:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:45:45,377 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-23 06:45:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:45,431 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 06:45:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:45:45,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2018-11-23 06:45:45,432 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:45,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2018-11-23 06:45:45,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 06:45:45,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-23 06:45:45,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2018-11-23 06:45:45,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:45,433 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-23 06:45:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2018-11-23 06:45:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 06:45:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 06:45:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 06:45:45,435 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 06:45:45,435 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 06:45:45,435 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 06:45:45,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2018-11-23 06:45:45,435 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 06:45:45,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:45,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:45,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:45:45,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:45,437 INFO L794 eck$LassoCheckResult]: Stem: 1395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1394#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1390#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1391#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1392#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1393#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1416#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1414#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1412#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1410#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1408#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1406#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1405#L23-3 assume !(main_~i~1 < 5); 1389#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1379#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1380#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1381#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1382#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1386#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1421#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1420#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1419#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1418#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1402#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1401#L9-3 assume !(avg_~i~0 < 5); 1377#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1378#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1398#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1399#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1400#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1417#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1415#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1413#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1411#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1409#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1407#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1404#L9-7 [2018-11-23 06:45:45,437 INFO L796 eck$LassoCheckResult]: Loop: 1404#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1403#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1404#L9-7 [2018-11-23 06:45:45,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2018-11-23 06:45:45,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2018-11-23 06:45:45,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2018-11-23 06:45:45,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:45:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 06:45:45,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:45:45,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 06:45:45,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:45:45,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:45:45,658 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-23 06:45:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:45:45,785 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 06:45:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:45:45,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2018-11-23 06:45:45,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:45:45,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2018-11-23 06:45:45,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 06:45:45,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-23 06:45:45,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2018-11-23 06:45:45,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:45:45,787 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 06:45:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2018-11-23 06:45:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 06:45:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 06:45:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 06:45:45,789 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 06:45:45,789 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 06:45:45,790 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 06:45:45,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2018-11-23 06:45:45,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 06:45:45,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:45:45,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:45:45,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:45:45,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:45:45,791 INFO L794 eck$LassoCheckResult]: Stem: 1518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1515#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1536#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1535#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1533#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1531#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1529#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1526#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1525#L23-3 assume !(main_~i~1 < 5); 1510#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1505#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1506#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1507#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1534#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1532#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1530#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1528#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1527#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1524#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1523#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1522#L9-3 assume !(avg_~i~0 < 5); 1503#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1504#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1519#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1520#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1521#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1544#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1543#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1542#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1541#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1540#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1539#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1538#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1537#L9-8 assume !(avg_~i~0 < 5); 1516#L9-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1517#L12-1 main_#t~ret7 := avg_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 1508#L32-3 [2018-11-23 06:45:45,791 INFO L796 eck$LassoCheckResult]: Loop: 1508#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 1509#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 1508#L32-3 [2018-11-23 06:45:45,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2018-11-23 06:45:45,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:45:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2018-11-23 06:45:45,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:45:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2018-11-23 06:45:45,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:45:45,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:45:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:45:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:45:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:45:48,320 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 335 DAG size of output: 258 [2018-11-23 06:47:05,517 WARN L180 SmtUtils]: Spent 1.28 m on a formula simplification. DAG size of input: 223 DAG size of output: 151 [2018-11-23 06:47:05,519 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:47:05,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:47:05,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:47:05,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:47:05,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:47:05,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:47:05,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:47:05,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:47:05,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-23 06:47:05,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:47:05,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:47:05,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 06:47:05,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:05,940 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-11-23 06:47:12,799 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5516 conjuctions. This might take some time... [2018-11-23 06:47:12,832 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-11-23 06:47:13,591 WARN L180 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 106 [2018-11-23 06:47:13,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:47:13,642 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 06:47:14,917 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 243 DAG size of output: 139 [2018-11-23 06:47:14,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-23 06:47:16,905 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 206 DAG size of output: 125 [2018-11-23 06:47:16,918 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:47:16,919 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:47:16,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:47:16,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:47:16,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:47:16,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:47:16,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:47:16,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:47:16,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:47:16,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:47:16,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:47:16,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:47:16,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:47:16,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:47:16,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:47:16,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:47:16,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:47:16,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:47:16,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:47:16,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:47:16,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:47:16,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:47:16,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:47:16,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:47:16,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:47:16,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:47:16,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:47:16,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:47:16,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:47:16,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:47:16,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:47:16,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:47:16,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:47:16,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:47:16,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:47:16,960 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 06:47:16,960 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 06:47:16,961 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:47:16,962 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:47:16,962 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:47:16,962 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2018-11-23 06:47:17,073 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2018-11-23 06:47:17,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:47:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:47:17,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:47:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:47:17,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:47:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:47:17,130 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:47:17,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-23 06:47:17,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2018-11-23 06:47:17,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:47:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:47:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 06:47:17,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2018-11-23 06:47:17,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:47:17,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2018-11-23 06:47:17,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:47:17,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-23 06:47:17,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:47:17,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2018-11-23 06:47:17,141 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:47:17,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2018-11-23 06:47:17,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:47:17,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:47:17,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:47:17,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:47:17,142 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:47:17,142 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:47:17,142 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:47:17,142 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 06:47:17,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:47:17,142 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:47:17,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:47:17,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:47:17 BoogieIcfgContainer [2018-11-23 06:47:17,149 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:47:17,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:47:17,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:47:17,150 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:47:17,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:45:42" (3/4) ... [2018-11-23 06:47:17,153 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:47:17,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:47:17,153 INFO L168 Benchmark]: Toolchain (without parser) took 95170.91 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 960.8 MB in the beginning and 1.7 GB in the end (delta: -752.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-23 06:47:17,154 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:47:17,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.23 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:47:17,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.12 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:47:17,155 INFO L168 Benchmark]: Boogie Preprocessor took 53.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -205.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:47:17,156 INFO L168 Benchmark]: RCFGBuilder took 203.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:47:17,156 INFO L168 Benchmark]: BuchiAutomizer took 94710.48 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -581.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-23 06:47:17,156 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 3.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:47:17,159 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.23 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.12 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -205.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 94710.48 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -581.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 3.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 94.6s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 93.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 227 SDtfs, 194 SDslu, 446 SDs, 0 SdLazy, 314 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1465 mio100 ax100 hnf99 lsp414 ukn42 mio100 lsp243 div81 bol100 ite100 ukn100 eq160 hnf91 smp71 dnf1253 smp68 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...