./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:42:53,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:42:53,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:42:53,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:42:53,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:42:53,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:42:53,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:42:53,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:42:53,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:42:53,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:42:53,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:42:53,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:42:53,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:42:53,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:42:53,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:42:53,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:42:53,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:42:53,506 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:42:53,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:42:53,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:42:53,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:42:53,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:42:53,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:42:53,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:42:53,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:42:53,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:42:53,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:42:53,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:42:53,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:42:53,528 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:42:53,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:42:53,529 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:42:53,529 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:42:53,529 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:42:53,530 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:42:53,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:42:53,533 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:42:53,557 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:42:53,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:42:53,558 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:42:53,559 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:42:53,559 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:42:53,559 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:42:53,560 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:42:53,560 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:42:53,560 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:42:53,560 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:42:53,560 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:42:53,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:42:53,561 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:42:53,561 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:42:53,561 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:42:53,561 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:42:53,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:42:53,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:42:53,563 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:42:53,563 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:42:53,564 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:42:53,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:42:53,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:42:53,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:42:53,564 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:42:53,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:42:53,566 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:42:53,566 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:42:53,567 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:42:53,567 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 [2019-01-01 21:42:53,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:42:53,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:42:53,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:42:53,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:42:53,647 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:42:53,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2019-01-01 21:42:53,723 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16cd4fc0/31682153ae8e45b9b63805069d3b694f/FLAG774811817 [2019-01-01 21:42:54,357 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:42:54,357 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2019-01-01 21:42:54,379 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16cd4fc0/31682153ae8e45b9b63805069d3b694f/FLAG774811817 [2019-01-01 21:42:54,566 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16cd4fc0/31682153ae8e45b9b63805069d3b694f [2019-01-01 21:42:54,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:42:54,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:42:54,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:54,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:42:54,579 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:42:54,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:54" (1/1) ... [2019-01-01 21:42:54,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68686ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:54, skipping insertion in model container [2019-01-01 21:42:54,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:54" (1/1) ... [2019-01-01 21:42:54,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:42:54,643 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:42:55,080 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:55,100 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:42:55,265 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:55,325 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:42:55,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55 WrapperNode [2019-01-01 21:42:55,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:55,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:55,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:42:55,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:42:55,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:55,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:42:55,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:42:55,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:42:55,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:42:55,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:42:55,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:42:55,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:42:55,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (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 [2019-01-01 21:42:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:42:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:42:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:42:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:42:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:42:55,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:42:55,909 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:42:55,909 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:42:55,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:55 BoogieIcfgContainer [2019-01-01 21:42:55,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:42:55,911 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:42:55,911 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:42:55,915 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:42:55,916 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:55,917 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:42:54" (1/3) ... [2019-01-01 21:42:55,918 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f417ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:55, skipping insertion in model container [2019-01-01 21:42:55,919 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:55,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55" (2/3) ... [2019-01-01 21:42:55,921 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f417ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:55, skipping insertion in model container [2019-01-01 21:42:55,921 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:55,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:55" (3/3) ... [2019-01-01 21:42:55,924 INFO L375 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca_false-termination.c.i [2019-01-01 21:42:55,984 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:42:55,985 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:42:55,985 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:42:55,986 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:42:55,986 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:42:55,986 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:42:55,986 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:42:55,986 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:42:55,986 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:42:56,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:42:56,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:42:56,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:56,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:56,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:42:56,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:56,034 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:42:56,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:42:56,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:42:56,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:56,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:56,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:42:56,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:56,048 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 14#L552-3true [2019-01-01 21:42:56,048 INFO L796 eck$LassoCheckResult]: Loop: 14#L552-3true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L551-1true assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 8#L552true assume !main_#t~short7; 12#L552-2true assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 14#L552-3true [2019-01-01 21:42:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:42:56,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:56,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:56,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2019-01-01 21:42:56,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:56,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:56,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:56,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2019-01-01 21:42:56,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:56,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:56,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:56,547 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-01-01 21:42:56,935 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-01 21:42:57,051 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:57,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:57,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:57,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:57,054 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:57,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:57,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:57,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:57,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca_false-termination.c.i_Iteration1_Lasso [2019-01-01 21:42:57,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:57,055 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:57,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:57,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:58,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:58,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:58,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:58,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:58,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:58,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:58,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:58,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:58,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:58,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:58,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:58,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:58,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:58,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:58,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:42:58,474 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:42:58,476 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:58,478 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:58,479 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:58,480 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-01-01 21:42:58,537 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:42:58,547 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:42:58,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:58,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:58,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:58,734 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:42:58,735 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-01-01 21:42:58,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 10 states. [2019-01-01 21:42:58,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:42:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 21:42:58,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:42:58,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:58,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:42:58,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:58,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:42:58,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:58,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-01-01 21:42:58,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:42:58,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2019-01-01 21:42:58,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:42:58,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 21:42:58,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2019-01-01 21:42:58,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:58,956 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-01-01 21:42:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2019-01-01 21:42:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-01-01 21:42:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:42:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-01 21:42:58,986 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:42:58,986 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:42:58,986 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:42:58,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-01 21:42:58,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:42:58,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:58,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:58,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:42:58,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:42:58,990 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 117#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 129#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 130#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 125#L552-2 [2019-01-01 21:42:58,990 INFO L796 eck$LassoCheckResult]: Loop: 125#L552-2 assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 128#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 133#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 124#L552 assume !main_#t~short7; 125#L552-2 [2019-01-01 21:42:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-01-01 21:42:58,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:58,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:58,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:58,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:58,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2019-01-01 21:42:59,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:59,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:59,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:59,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:42:59,123 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:42:59,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:42:59,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:42:59,129 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:42:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:59,352 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-01-01 21:42:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:42:59,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-01-01 21:42:59,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:42:59,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2019-01-01 21:42:59,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:42:59,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:42:59,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-01-01 21:42:59,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:59,359 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 21:42:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-01-01 21:42:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 21:42:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:42:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-01-01 21:42:59,364 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 21:42:59,364 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 21:42:59,364 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:42:59,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-01-01 21:42:59,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:42:59,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:59,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:59,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:42:59,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:42:59,368 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 171#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 184#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 178#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 180#L552-2 [2019-01-01 21:42:59,368 INFO L796 eck$LassoCheckResult]: Loop: 180#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 187#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 183#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 186#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 189#L552 assume !main_#t~short7; 180#L552-2 [2019-01-01 21:42:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2019-01-01 21:42:59,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:59,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2019-01-01 21:42:59,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:59,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:59,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:59,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:42:59,516 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:42:59,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:42:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:42:59,517 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:42:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:59,633 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-01-01 21:42:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:42:59,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-01-01 21:42:59,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-01 21:42:59,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2019-01-01 21:42:59,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 21:42:59,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-01 21:42:59,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-01-01 21:42:59,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:59,639 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-01 21:42:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-01-01 21:42:59,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-01 21:42:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 21:42:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-01 21:42:59,643 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 21:42:59,643 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 21:42:59,643 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:42:59,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-01 21:42:59,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:42:59,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:59,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:59,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:42:59,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:42:59,647 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 230#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 231#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 247#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 249#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-01-01 21:42:59,648 INFO L796 eck$LassoCheckResult]: Loop: 239#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 252#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 235#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 244#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 238#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-01-01 21:42:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2019-01-01 21:42:59,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:59,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2019-01-01 21:42:59,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:59,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:59,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:59,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2019-01-01 21:42:59,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:59,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:59,941 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-01-01 21:43:00,256 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-01-01 21:43:00,567 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-01-01 21:43:00,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:43:00 BoogieIcfgContainer [2019-01-01 21:43:00,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:43:00,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:43:00,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:43:00,601 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:43:00,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:55" (3/4) ... [2019-01-01 21:43:00,608 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 21:43:00,672 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:43:00,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:43:00,678 INFO L168 Benchmark]: Toolchain (without parser) took 6106.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.0 MB in the beginning and 840.7 MB in the end (delta: 105.3 MB). Peak memory consumption was 233.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:00,680 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:00,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:00,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:00,687 INFO L168 Benchmark]: Boogie Preprocessor took 28.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:00,688 INFO L168 Benchmark]: RCFGBuilder took 496.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:00,689 INFO L168 Benchmark]: BuchiAutomizer took 4689.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 840.7 MB in the end (delta: 250.1 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:00,695 INFO L168 Benchmark]: Witness Printer took 71.44 ms. Allocated memory is still 1.2 GB. Free memory is still 840.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:00,703 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 752.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 496.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4689.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 840.7 MB in the end (delta: 250.1 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. * Witness Printer took 71.44 ms. Allocated memory is still 1.2 GB. Free memory is still 840.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 16 SDslu, 27 SDs, 0 SdLazy, 75 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax117 hnf100 lsp77 ukn72 mio100 lsp40 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf120 smp100 tf100 neg94 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@316a3f25=-1, NULL=0, \result=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d82774=0, NULL=0, x=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@316a3f25=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@534d058=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@58eb0d71=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2112c32f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@121181d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@21482f63=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1d30d034=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@470a2efb=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...