./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8dfe6e301265e265404ce5be2c9f54235040b69e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:02:43,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:02:43,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:02:43,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:02:43,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:02:43,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:02:43,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:02:43,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:02:43,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:02:43,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:02:43,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:02:43,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:02:43,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:02:43,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:02:43,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:02:43,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:02:43,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:02:43,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:02:43,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:02:43,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:02:43,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:02:43,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:02:43,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:02:43,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:02:43,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:02:43,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:02:43,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:02:43,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:02:43,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:02:43,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:02:43,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:02:43,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:02:43,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:02:43,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:02:43,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:02:43,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:02:43,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:02:43,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:02:43,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:02:43,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:02:43,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:02:43,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:02:43,621 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:02:43,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:02:43,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:02:43,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:02:43,623 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:02:43,623 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:02:43,623 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:02:43,623 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:02:43,623 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:02:43,624 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:02:43,624 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:02:43,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:02:43,624 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:02:43,624 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:02:43,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:02:43,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:02:43,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:02:43,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:02:43,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:02:43,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:02:43,626 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:02:43,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:02:43,626 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:02:43,626 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:02:43,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:02:43,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:02:43,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:02:43,627 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:02:43,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:02:43,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:02:43,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:02:43,628 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:02:43,629 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:02:43,629 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8dfe6e301265e265404ce5be2c9f54235040b69e [2020-10-20 07:02:43,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:02:43,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:02:43,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:02:43,866 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:02:43,867 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:02:43,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-10-20 07:02:43,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9717b157f/c8d2314ae9cc453ba1a62b241db636fa/FLAG63e8977b3 [2020-10-20 07:02:44,491 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:02:44,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2020-10-20 07:02:44,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9717b157f/c8d2314ae9cc453ba1a62b241db636fa/FLAG63e8977b3 [2020-10-20 07:02:44,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9717b157f/c8d2314ae9cc453ba1a62b241db636fa [2020-10-20 07:02:44,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:02:44,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:02:44,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:44,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:02:44,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:02:44,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:44" (1/1) ... [2020-10-20 07:02:44,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133c1693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:44, skipping insertion in model container [2020-10-20 07:02:44,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:44" (1/1) ... [2020-10-20 07:02:44,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:02:44,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:02:45,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:45,174 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:02:45,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:45,324 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:02:45,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45 WrapperNode [2020-10-20 07:02:45,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:45,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:45,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:02:45,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:02:45,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:45,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:02:45,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:02:45,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:02:45,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... [2020-10-20 07:02:45,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:02:45,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:02:45,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:02:45,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:02:45,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 07:02:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 07:02:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 07:02:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 07:02:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 07:02:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:02:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 07:02:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:02:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:02:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:02:45,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:02:45,819 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:02:45,820 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-10-20 07:02:45,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:45 BoogieIcfgContainer [2020-10-20 07:02:45,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:02:45,823 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:02:45,823 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:02:45,827 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:02:45,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:45,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:02:44" (1/3) ... [2020-10-20 07:02:45,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ba8c65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:45, skipping insertion in model container [2020-10-20 07:02:45,830 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:45,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:45" (2/3) ... [2020-10-20 07:02:45,830 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ba8c65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:45, skipping insertion in model container [2020-10-20 07:02:45,831 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:45,831 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:45" (3/3) ... [2020-10-20 07:02:45,833 INFO L373 chiAutomizerObserver]: Analyzing ICFG simple-ext.i [2020-10-20 07:02:45,878 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:02:45,879 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:02:45,879 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:02:45,879 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:02:45,880 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:02:45,880 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:02:45,880 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:02:45,880 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:02:45,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-10-20 07:02:45,920 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-10-20 07:02:45,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:45,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:45,927 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 07:02:45,927 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:02:45,927 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:02:45,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-10-20 07:02:45,930 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2020-10-20 07:02:45,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:45,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:45,930 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 07:02:45,931 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:02:45,945 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 13#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 11#L533true assume main_~a~0.base == 0 && main_~a~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 5#L525true [2020-10-20 07:02:45,946 INFO L796 eck$LassoCheckResult]: Loop: 5#L525true assume true; 5#L525true [2020-10-20 07:02:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-10-20 07:02:45,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:45,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580794330] [2020-10-20 07:02:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:46,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580794330] [2020-10-20 07:02:46,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:46,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:02:46,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097543019] [2020-10-20 07:02:46,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:02:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 108, now seen corresponding path program 1 times [2020-10-20 07:02:46,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:46,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078857091] [2020-10-20 07:02:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,208 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:46,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:02:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:02:46,242 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2020-10-20 07:02:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:46,291 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-10-20 07:02:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:02:46,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2020-10-20 07:02:46,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 07:02:46,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 14 states and 17 transitions. [2020-10-20 07:02:46,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 07:02:46,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 07:02:46,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-10-20 07:02:46,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:46,307 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-20 07:02:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-10-20 07:02:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-20 07:02:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 07:02:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-10-20 07:02:46,343 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-20 07:02:46,343 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-10-20 07:02:46,344 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:02:46,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-10-20 07:02:46,347 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 07:02:46,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:46,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:46,349 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:02:46,349 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:02:46,349 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 62#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 60#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 61#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 56#L537-2 [2020-10-20 07:02:46,350 INFO L796 eck$LassoCheckResult]: Loop: 56#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 58#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 64#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 56#L537-2 [2020-10-20 07:02:46,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:46,351 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2020-10-20 07:02:46,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:46,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856421146] [2020-10-20 07:02:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,436 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 48852, now seen corresponding path program 1 times [2020-10-20 07:02:46,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:46,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499260092] [2020-10-20 07:02:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,479 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:46,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1807773776, now seen corresponding path program 1 times [2020-10-20 07:02:46,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:46,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377454517] [2020-10-20 07:02:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:46,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:46,555 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:46,893 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2020-10-20 07:02:46,968 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:47,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:47,073 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:47,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:47,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:47,148 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:133 [2020-10-20 07:02:47,412 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2020-10-20 07:02:47,523 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:02:47,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:02:47,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:02:47,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:02:47,525 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:02:47,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:47,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:02:47,526 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:02:47,526 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-ext.i_Iteration2_Lasso [2020-10-20 07:02:47,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:02:47,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:02:47,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,841 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-10-20 07:02:47,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:47,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:48,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:48,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:48,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:48,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:48,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:02:48,444 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2020-10-20 07:02:48,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:02:48,598 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:02:48,612 INFO L120 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 [2020-10-20 07:02:48,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:02:48,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:02:48,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:02:48,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:02:48,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:02:48,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:02:48,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,671 INFO L120 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 [2020-10-20 07:02:48,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:02:48,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:02:48,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:02:48,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:02:48,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:02:48,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:02:48,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:02:48,732 INFO L120 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 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:02:48,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:02:48,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:02:48,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:02:48,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:02:48,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:02:48,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,771 INFO L120 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 [2020-10-20 07:02:48,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:02:48,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:02:48,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:02:48,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:02:48,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:02:48,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:02:48,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,823 INFO L120 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 [2020-10-20 07:02:48,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:02:48,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:02:48,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:02:48,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:02:48,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:02:48,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:02:48,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,887 INFO L120 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 [2020-10-20 07:02:48,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:02:48,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:02:48,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:02:48,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:02:48,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:02:48,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:02:48,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,936 INFO L120 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 [2020-10-20 07:02:48,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:02:48,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:02:48,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:02:48,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:02:48,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:02:48,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:02:48,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:02:48,963 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-20 07:02:48,963 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:02:48,976 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:02:48,980 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:02:48,980 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:02:48,981 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2020-10-20 07:02:49,066 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-10-20 07:02:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:49,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:02:49,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:02:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:49,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:02:49,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:02:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:49,255 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 [2020-10-20 07:02:49,256 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-20 07:02:49,312 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 7 states. [2020-10-20 07:02:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:02:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:02:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-20 07:02:49,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2020-10-20 07:02:49,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:02:49,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-20 07:02:49,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:02:49,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-20 07:02:49,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:02:49,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-10-20 07:02:49,333 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-20 07:02:49,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 16 states and 21 transitions. [2020-10-20 07:02:49,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:02:49,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 07:02:49,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-10-20 07:02:49,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:02:49,336 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-20 07:02:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-10-20 07:02:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-20 07:02:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 07:02:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-10-20 07:02:49,339 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-20 07:02:49,339 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-10-20 07:02:49,339 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:02:49,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-10-20 07:02:49,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-20 07:02:49,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:49,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:49,341 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:02:49,342 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:02:49,342 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 174#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 172#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 173#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 166#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 167#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 162#L549-2 [2020-10-20 07:02:49,342 INFO L796 eck$LassoCheckResult]: Loop: 162#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 164#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 161#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 162#L549-2 [2020-10-20 07:02:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash 889599219, now seen corresponding path program 1 times [2020-10-20 07:02:49,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849292899] [2020-10-20 07:02:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 69961, now seen corresponding path program 1 times [2020-10-20 07:02:49,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134219686] [2020-10-20 07:02:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,395 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2102157079, now seen corresponding path program 1 times [2020-10-20 07:02:49,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960373144] [2020-10-20 07:02:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:49,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960373144] [2020-10-20 07:02:49,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:49,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:02:49,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372945795] [2020-10-20 07:02:49,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:02:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:02:49,569 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-20 07:02:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:49,681 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-10-20 07:02:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:02:49,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2020-10-20 07:02:49,691 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6 [2020-10-20 07:02:49,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 35 transitions. [2020-10-20 07:02:49,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 07:02:49,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 07:02:49,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2020-10-20 07:02:49,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:02:49,696 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-10-20 07:02:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2020-10-20 07:02:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2020-10-20 07:02:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 07:02:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-10-20 07:02:49,701 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-20 07:02:49,702 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-10-20 07:02:49,702 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:02:49,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-10-20 07:02:49,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-20 07:02:49,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:49,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:49,704 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:02:49,704 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:02:49,705 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 235#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 233#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 234#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 226#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 229#L540 assume main_~t~0.base == 0 && main_~t~0.offset == 0;myexit_#in~s := 1;havoc myexit_~s;myexit_~s := myexit_#in~s; 232#L525-1 [2020-10-20 07:02:49,705 INFO L796 eck$LassoCheckResult]: Loop: 232#L525-1 assume true; 232#L525-1 [2020-10-20 07:02:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 889599272, now seen corresponding path program 1 times [2020-10-20 07:02:49,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610857107] [2020-10-20 07:02:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:49,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610857107] [2020-10-20 07:02:49,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:49,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:02:49,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975041419] [2020-10-20 07:02:49,747 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:02:49,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times [2020-10-20 07:02:49,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930620111] [2020-10-20 07:02:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,756 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:49,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:02:49,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:02:49,759 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 07:02:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:49,768 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-10-20 07:02:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:02:49,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2020-10-20 07:02:49,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-10-20 07:02:49,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2020-10-20 07:02:49,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:02:49,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:02:49,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-10-20 07:02:49,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:49,771 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-10-20 07:02:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-10-20 07:02:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-10-20 07:02:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-20 07:02:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-20 07:02:49,773 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-20 07:02:49,774 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-20 07:02:49,774 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:02:49,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-10-20 07:02:49,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 07:02:49,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:49,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:49,775 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:49,775 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-10-20 07:02:49,776 INFO L794 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 276#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 274#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 275#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 269#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 270#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 266#L549-2 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 267#L549-3 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 268#L557-2 [2020-10-20 07:02:49,776 INFO L796 eck$LassoCheckResult]: Loop: 268#L557-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 268#L557-2 [2020-10-20 07:02:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash 206358793, now seen corresponding path program 1 times [2020-10-20 07:02:49,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250724513] [2020-10-20 07:02:49,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:49,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250724513] [2020-10-20 07:02:49,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:49,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:02:49,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940026238] [2020-10-20 07:02:49,812 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:02:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,812 INFO L82 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2020-10-20 07:02:49,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163099171] [2020-10-20 07:02:49,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,822 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:49,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:49,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:02:49,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:02:49,872 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-10-20 07:02:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:49,931 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-10-20 07:02:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:02:49,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-10-20 07:02:49,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 07:02:49,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2020-10-20 07:02:49,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:02:49,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:02:49,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-20 07:02:49,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:49,934 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 07:02:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-20 07:02:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-10-20 07:02:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:02:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-10-20 07:02:49,937 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 07:02:49,937 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 07:02:49,937 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:02:49,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-10-20 07:02:49,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 07:02:49,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:49,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:49,939 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:49,939 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:02:49,940 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 326#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 324#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 325#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 320#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 321#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 328#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 322#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 323#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 316#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-10-20 07:02:49,940 INFO L796 eck$LassoCheckResult]: Loop: 317#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 314#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 315#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 317#L550 [2020-10-20 07:02:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash 793653610, now seen corresponding path program 1 times [2020-10-20 07:02:49,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:49,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924336610] [2020-10-20 07:02:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:49,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,007 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 2 times [2020-10-20 07:02:50,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476058692] [2020-10-20 07:02:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,026 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,027 INFO L82 PathProgramCache]: Analyzing trace with hash -60215300, now seen corresponding path program 1 times [2020-10-20 07:02:50,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753248430] [2020-10-20 07:02:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:50,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753248430] [2020-10-20 07:02:50,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263227585] [2020-10-20 07:02:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:02:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:50,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 07:02:50,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:02:50,271 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 07:02:50,271 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,279 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 07:02:50,347 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,347 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 07:02:50,348 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,388 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 07:02:50,388 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,402 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,402 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2020-10-20 07:02:50,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 07:02:50,449 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 07:02:50,450 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:50,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:21 [2020-10-20 07:02:50,558 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 07:02:50,559 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2020-10-20 07:02:50,560 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,578 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:50,578 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:17 [2020-10-20 07:02:50,635 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 07:02:50,638 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,638 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2020-10-20 07:02:50,643 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:50,661 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:02:50,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2020-10-20 07:02:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:50,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:02:50,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-10-20 07:02:50,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203570597] [2020-10-20 07:02:50,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 07:02:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-20 07:02:50,749 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2020-10-20 07:02:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:51,130 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-10-20 07:02:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:02:51,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-10-20 07:02:51,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 07:02:51,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 25 transitions. [2020-10-20 07:02:51,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:02:51,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:02:51,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2020-10-20 07:02:51,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:51,141 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-10-20 07:02:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2020-10-20 07:02:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2020-10-20 07:02:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-20 07:02:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-10-20 07:02:51,143 INFO L714 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 07:02:51,143 INFO L594 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 07:02:51,144 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:02:51,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-10-20 07:02:51,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-10-20 07:02:51,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:51,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:51,145 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:51,145 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 07:02:51,145 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 433#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~post9, main_#t~nondet6, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~post12, main_#t~mem13.base, main_#t~mem13.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; 431#L533 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 432#L533-1 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 426#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 427#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 435#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 428#L537-2 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 429#L540 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 437#L540-1 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 436#L537-2 assume !(main_~i~0 < 30 && 0 != main_#t~nondet6);havoc main_#t~nondet6; 430#L537-3 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 422#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-10-20 07:02:51,145 INFO L796 eck$LassoCheckResult]: Loop: 423#L550 assume !(1 != main_#t~mem10);havoc main_#t~mem10; 420#L550-2 call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 421#L549-2 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem10 := read~int(main_~p~0.base, main_~p~0.offset, 4); 423#L550 [2020-10-20 07:02:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash -8921739, now seen corresponding path program 2 times [2020-10-20 07:02:51,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157584679] [2020-10-20 07:02:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,239 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash 83461, now seen corresponding path program 3 times [2020-10-20 07:02:51,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137138304] [2020-10-20 07:02:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,264 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 500499473, now seen corresponding path program 2 times [2020-10-20 07:02:51,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489384373] [2020-10-20 07:02:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:51,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489384373] [2020-10-20 07:02:51,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257496119] [2020-10-20 07:02:51,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:02:51,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:02:51,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:02:51,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 52 conjunts are in the unsatisfiable core [2020-10-20 07:02:51,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:02:51,530 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-20 07:02:51,530 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:51,535 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 07:02:51,603 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:51,603 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-20 07:02:51,604 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,640 INFO L625 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2020-10-20 07:02:51,645 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 07:02:51,645 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,664 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:51,665 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,665 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2020-10-20 07:02:51,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 07:02:51,715 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-10-20 07:02:51,716 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:51,731 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:51,731 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:34 [2020-10-20 07:02:51,794 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:51,794 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-20 07:02:51,795 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:51,827 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 07:02:51,828 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:51,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:51,845 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:51,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2020-10-20 07:02:51,989 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-20 07:02:51,989 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2020-10-20 07:02:51,992 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:52,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:52,014 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:52,014 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:48 [2020-10-20 07:02:52,118 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2020-10-20 07:02:52,120 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:52,149 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.3 percent of original size [2020-10-20 07:02:52,155 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 07:02:52,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2020-10-20 07:02:52,292 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 07:02:52,294 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 07:02:52,301 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:52,302 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2020-10-20 07:02:52,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:02:52,307 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:02:52,335 INFO L625 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2020-10-20 07:02:52,346 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:02:52,347 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:3 [2020-10-20 07:02:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:02:52,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:02:52,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-20 07:02:52,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039775162] [2020-10-20 07:02:52,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:52,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 07:02:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-10-20 07:02:52,408 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand 17 states. [2020-10-20 07:03:06,511 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-10-20 07:03:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:06,670 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-10-20 07:03:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 07:03:06,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2020-10-20 07:03:06,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:03:06,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-10-20 07:03:06,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 07:03:06,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 07:03:06,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 07:03:06,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:06,673 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:03:06,673 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:03:06,673 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:03:06,673 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 07:03:06,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 07:03:06,673 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:03:06,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 07:03:06,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:03:06 BoogieIcfgContainer [2020-10-20 07:03:06,679 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:03:06,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:03:06,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:03:06,680 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:03:06,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:45" (3/4) ... [2020-10-20 07:03:06,684 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 07:03:06,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:03:06,686 INFO L168 Benchmark]: Toolchain (without parser) took 21969.02 ms. Allocated memory was 34.6 MB in the beginning and 82.8 MB in the end (delta: 48.2 MB). Free memory was 10.7 MB in the beginning and 14.0 MB in the end (delta: -3.3 MB). Peak memory consumption was 44.9 MB. Max. memory is 14.3 GB. [2020-10-20 07:03:06,686 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.6 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. [2020-10-20 07:03:06,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.57 ms. Allocated memory was 34.6 MB in the beginning and 43.0 MB in the end (delta: 8.4 MB). Free memory was 9.8 MB in the beginning and 24.5 MB in the end (delta: -14.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:03:06,688 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.26 ms. Allocated memory is still 43.0 MB. Free memory was 24.5 MB in the beginning and 22.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 07:03:06,688 INFO L168 Benchmark]: Boogie Preprocessor took 29.66 ms. Allocated memory is still 43.0 MB. Free memory was 22.4 MB in the beginning and 20.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 07:03:06,689 INFO L168 Benchmark]: RCFGBuilder took 421.79 ms. Allocated memory was 43.0 MB in the beginning and 45.1 MB in the end (delta: 2.1 MB). Free memory was 20.7 MB in the beginning and 17.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. [2020-10-20 07:03:06,689 INFO L168 Benchmark]: BuchiAutomizer took 20856.58 ms. Allocated memory was 45.1 MB in the beginning and 82.8 MB in the end (delta: 37.7 MB). Free memory was 17.0 MB in the beginning and 14.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 40.7 MB. Max. memory is 14.3 GB. [2020-10-20 07:03:06,690 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 82.8 MB. Free memory is still 14.0 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 07:03:06,693 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 33.6 MB. Free memory was 18.6 MB in the beginning and 18.6 MB in the end (delta: 41.7 kB). Peak memory consumption was 41.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 601.57 ms. Allocated memory was 34.6 MB in the beginning and 43.0 MB in the end (delta: 8.4 MB). Free memory was 9.8 MB in the beginning and 24.5 MB in the end (delta: -14.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 45.26 ms. Allocated memory is still 43.0 MB. Free memory was 24.5 MB in the beginning and 22.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 29.66 ms. Allocated memory is still 43.0 MB. Free memory was 22.4 MB in the beginning and 20.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 421.79 ms. Allocated memory was 43.0 MB in the beginning and 45.1 MB in the end (delta: 2.1 MB). Free memory was 20.7 MB in the beginning and 17.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 20856.58 ms. Allocated memory was 45.1 MB in the beginning and 82.8 MB in the end (delta: 37.7 MB). Free memory was 17.0 MB in the beginning and 14.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 40.7 MB. Max. memory is 14.3 GB. * Witness Printer took 4.55 ms. Allocated memory is still 82.8 MB. Free memory is still 14.0 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 12.6s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 152 SDslu, 58 SDs, 0 SdLazy, 317 SolverSat, 62 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN2 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax107 hnf100 lsp88 ukn51 mio100 lsp29 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf175 smp93 tf100 neg95 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...