./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/locks/test_locks_5.c -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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 20:39:23,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:39:23,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:39:23,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:39:23,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:39:23,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:39:23,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:39:23,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:39:23,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:39:23,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:39:23,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:39:23,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:39:23,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:39:23,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:39:23,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:39:23,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:39:23,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:39:23,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:39:23,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:39:23,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:39:23,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:39:23,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:39:23,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:39:23,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:39:23,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:39:23,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:39:23,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:39:23,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:39:23,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:39:23,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:39:23,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:39:23,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:39:23,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:39:23,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:39:23,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:39:23,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:39:23,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:39:23,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:39:23,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:39:23,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:39:23,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:39:23,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:39:23,679 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:39:23,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:39:23,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:39:23,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:39:23,681 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:39:23,682 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:39:23,682 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:39:23,682 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:39:23,682 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:39:23,683 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:39:23,683 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:39:23,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:39:23,683 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:39:23,684 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:39:23,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:39:23,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:39:23,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:39:23,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:39:23,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:39:23,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:39:23,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:39:23,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:39:23,686 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:39:23,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:39:23,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:39:23,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:39:23,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:39:23,688 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:39:23,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:39:23,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:39:23,688 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:39:23,689 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:39:23,690 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:39:23,690 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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-11-28 20:39:24,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:39:24,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:39:24,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:39:24,085 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:39:24,086 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:39:24,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2019-11-28 20:39:24,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd8ad03a/8e6932e100c24f6b930ba7ba8aae1001/FLAG7c94b2ac5 [2019-11-28 20:39:24,586 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:39:24,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2019-11-28 20:39:24,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd8ad03a/8e6932e100c24f6b930ba7ba8aae1001/FLAG7c94b2ac5 [2019-11-28 20:39:24,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd8ad03a/8e6932e100c24f6b930ba7ba8aae1001 [2019-11-28 20:39:24,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:39:24,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:39:24,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:24,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:39:24,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:39:24,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:24" (1/1) ... [2019-11-28 20:39:24,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2124999c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:24, skipping insertion in model container [2019-11-28 20:39:24,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:39:24" (1/1) ... [2019-11-28 20:39:24,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:39:25,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:39:25,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:25,170 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:39:25,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:39:25,216 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:39:25,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25 WrapperNode [2019-11-28 20:39:25,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:39:25,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:25,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:39:25,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:39:25,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:39:25,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:39:25,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:39:25,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:39:25,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (1/1) ... [2019-11-28 20:39:25,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:39:25,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:39:25,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:39:25,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:39:25,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (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-11-28 20:39:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:39:25,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:39:25,636 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:39:25,636 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:39:25,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:25 BoogieIcfgContainer [2019-11-28 20:39:25,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:39:25,639 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:39:25,639 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:39:25,646 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:39:25,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:25,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:39:24" (1/3) ... [2019-11-28 20:39:25,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22402b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:25, skipping insertion in model container [2019-11-28 20:39:25,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:25,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:39:25" (2/3) ... [2019-11-28 20:39:25,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22402b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:39:25, skipping insertion in model container [2019-11-28 20:39:25,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:39:25,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:25" (3/3) ... [2019-11-28 20:39:25,658 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c [2019-11-28 20:39:25,718 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:39:25,718 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:39:25,718 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:39:25,718 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:39:25,718 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:39:25,719 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:39:25,719 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:39:25,719 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:39:25,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-11-28 20:39:25,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 20:39:25,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:25,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:25,765 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:25,766 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:25,766 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:39:25,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-11-28 20:39:25,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 20:39:25,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:25,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:25,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:25,769 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:25,777 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;havoc main_~cond~0; 9#L83-1true [2019-11-28 20:39:25,777 INFO L796 eck$LassoCheckResult]: Loop: 9#L83-1true assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 4#L26true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 13#L41true assume 0 != main_~p1~0;main_~lk1~0 := 1; 8#L41-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 19#L45-1true assume !(0 != main_~p3~0); 6#L49-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 14#L53-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 22#L57-1true assume !(0 != main_~p1~0); 12#L63-1true assume !(0 != main_~p2~0); 24#L68-1true assume !(0 != main_~p3~0); 10#L73-1true assume !(0 != main_~p4~0); 21#L78-1true assume !(0 != main_~p5~0); 9#L83-1true [2019-11-28 20:39:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:39:25,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:25,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371478563] [2019-11-28 20:39:25,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:25,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1077541325, now seen corresponding path program 1 times [2019-11-28 20:39:25,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:25,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477336114] [2019-11-28 20:39:25,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:25,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477336114] [2019-11-28 20:39:25,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:25,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:25,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547629291] [2019-11-28 20:39:25,976 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:25,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:25,997 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-11-28 20:39:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:26,050 INFO L93 Difference]: Finished difference Result 44 states and 69 transitions. [2019-11-28 20:39:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:26,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 69 transitions. [2019-11-28 20:39:26,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-11-28 20:39:26,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 52 transitions. [2019-11-28 20:39:26,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-28 20:39:26,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-28 20:39:26,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 52 transitions. [2019-11-28 20:39:26,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:26,064 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2019-11-28 20:39:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 52 transitions. [2019-11-28 20:39:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 20:39:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 20:39:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2019-11-28 20:39:26,092 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2019-11-28 20:39:26,092 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2019-11-28 20:39:26,092 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:39:26,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 52 transitions. [2019-11-28 20:39:26,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-11-28 20:39:26,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:26,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:26,094 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:26,094 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:26,095 INFO L794 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;havoc main_~cond~0; 96#L83-1 [2019-11-28 20:39:26,095 INFO L796 eck$LassoCheckResult]: Loop: 96#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 103#L26 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 102#L41 assume !(0 != main_~p1~0); 84#L41-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 85#L45-1 assume !(0 != main_~p3~0); 101#L49-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 91#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 92#L57-1 assume !(0 != main_~p1~0); 88#L63-1 assume !(0 != main_~p2~0); 81#L68-1 assume !(0 != main_~p3~0); 94#L73-1 assume !(0 != main_~p4~0); 105#L78-1 assume !(0 != main_~p5~0); 96#L83-1 [2019-11-28 20:39:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 20:39:26,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327252283] [2019-11-28 20:39:26,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:26,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1470568335, now seen corresponding path program 1 times [2019-11-28 20:39:26,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123931950] [2019-11-28 20:39:26,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:26,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123931950] [2019-11-28 20:39:26,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:26,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:26,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508311220] [2019-11-28 20:39:26,140 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:26,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:26,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:26,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:26,143 INFO L87 Difference]: Start difference. First operand 34 states and 52 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-11-28 20:39:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:26,181 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2019-11-28 20:39:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:26,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 97 transitions. [2019-11-28 20:39:26,188 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2019-11-28 20:39:26,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 97 transitions. [2019-11-28 20:39:26,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-11-28 20:39:26,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-11-28 20:39:26,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 97 transitions. [2019-11-28 20:39:26,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:26,197 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2019-11-28 20:39:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 97 transitions. [2019-11-28 20:39:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 20:39:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 20:39:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2019-11-28 20:39:26,208 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2019-11-28 20:39:26,208 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2019-11-28 20:39:26,208 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:39:26,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 97 transitions. [2019-11-28 20:39:26,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2019-11-28 20:39:26,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:26,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:26,211 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:26,211 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:26,211 INFO L794 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;havoc main_~cond~0; 203#L83-1 [2019-11-28 20:39:26,211 INFO L796 eck$LassoCheckResult]: Loop: 203#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 212#L26 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 209#L41 assume !(0 != main_~p1~0); 210#L41-2 assume !(0 != main_~p2~0); 232#L45-1 assume !(0 != main_~p3~0); 231#L49-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 230#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 229#L57-1 assume !(0 != main_~p1~0); 228#L63-1 assume !(0 != main_~p2~0); 225#L68-1 assume !(0 != main_~p3~0); 221#L73-1 assume !(0 != main_~p4~0); 217#L78-1 assume !(0 != main_~p5~0); 203#L83-1 [2019-11-28 20:39:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,212 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-28 20:39:26,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372691116] [2019-11-28 20:39:26,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:26,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,227 INFO L82 PathProgramCache]: Analyzing trace with hash -790509965, now seen corresponding path program 1 times [2019-11-28 20:39:26,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082925852] [2019-11-28 20:39:26,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:26,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082925852] [2019-11-28 20:39:26,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:26,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:26,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126197098] [2019-11-28 20:39:26,261 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:26,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:26,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:26,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:26,262 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-11-28 20:39:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:26,283 INFO L93 Difference]: Finished difference Result 125 states and 181 transitions. [2019-11-28 20:39:26,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:26,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 181 transitions. [2019-11-28 20:39:26,286 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2019-11-28 20:39:26,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 181 transitions. [2019-11-28 20:39:26,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-11-28 20:39:26,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-11-28 20:39:26,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 181 transitions. [2019-11-28 20:39:26,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:26,294 INFO L688 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2019-11-28 20:39:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 181 transitions. [2019-11-28 20:39:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-28 20:39:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 20:39:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2019-11-28 20:39:26,314 INFO L711 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2019-11-28 20:39:26,314 INFO L591 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2019-11-28 20:39:26,315 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:39:26,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 181 transitions. [2019-11-28 20:39:26,317 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2019-11-28 20:39:26,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:26,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:26,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:26,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:26,322 INFO L794 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;havoc main_~cond~0; 399#L83-1 [2019-11-28 20:39:26,323 INFO L796 eck$LassoCheckResult]: Loop: 399#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 411#L26 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 412#L41 assume !(0 != main_~p1~0); 460#L41-2 assume !(0 != main_~p2~0); 457#L45-1 assume !(0 != main_~p3~0); 453#L49-1 assume !(0 != main_~p4~0); 449#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 447#L57-1 assume !(0 != main_~p1~0); 445#L63-1 assume !(0 != main_~p2~0); 442#L68-1 assume !(0 != main_~p3~0); 438#L73-1 assume !(0 != main_~p4~0); 439#L78-1 assume !(0 != main_~p5~0); 399#L83-1 [2019-11-28 20:39:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-28 20:39:26,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289251863] [2019-11-28 20:39:26,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash 984497397, now seen corresponding path program 1 times [2019-11-28 20:39:26,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407411843] [2019-11-28 20:39:26,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:26,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407411843] [2019-11-28 20:39:26,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:26,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:39:26,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099849444] [2019-11-28 20:39:26,380 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:26,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:26,382 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. cyclomatic complexity: 64 Second operand 3 states. [2019-11-28 20:39:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:26,417 INFO L93 Difference]: Finished difference Result 241 states and 337 transitions. [2019-11-28 20:39:26,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:26,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 337 transitions. [2019-11-28 20:39:26,424 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2019-11-28 20:39:26,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 337 transitions. [2019-11-28 20:39:26,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-11-28 20:39:26,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2019-11-28 20:39:26,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 337 transitions. [2019-11-28 20:39:26,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:39:26,430 INFO L688 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2019-11-28 20:39:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 337 transitions. [2019-11-28 20:39:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-28 20:39:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-28 20:39:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 337 transitions. [2019-11-28 20:39:26,455 INFO L711 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2019-11-28 20:39:26,455 INFO L591 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2019-11-28 20:39:26,455 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:39:26,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 337 transitions. [2019-11-28 20:39:26,457 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2019-11-28 20:39:26,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:26,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:26,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:39:26,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:26,458 INFO L794 eck$LassoCheckResult]: Stem: 770#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;havoc main_~cond~0; 771#L83-1 [2019-11-28 20:39:26,459 INFO L796 eck$LassoCheckResult]: Loop: 771#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 832#L26 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0; 826#L41 assume !(0 != main_~p1~0); 820#L41-2 assume !(0 != main_~p2~0); 814#L45-1 assume !(0 != main_~p3~0); 815#L49-1 assume !(0 != main_~p4~0); 865#L53-1 assume !(0 != main_~p5~0); 864#L57-1 assume !(0 != main_~p1~0); 862#L63-1 assume !(0 != main_~p2~0); 860#L68-1 assume !(0 != main_~p3~0); 857#L73-1 assume !(0 != main_~p4~0); 841#L78-1 assume !(0 != main_~p5~0); 771#L83-1 [2019-11-28 20:39:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-28 20:39:26,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134678070] [2019-11-28 20:39:26,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1041755699, now seen corresponding path program 1 times [2019-11-28 20:39:26,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978435710] [2019-11-28 20:39:26,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,482 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:26,483 INFO L82 PathProgramCache]: Analyzing trace with hash 536197074, now seen corresponding path program 1 times [2019-11-28 20:39:26,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:26,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380067199] [2019-11-28 20:39:26,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:26,505 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:26,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:39:26 BoogieIcfgContainer [2019-11-28 20:39:26,664 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:39:26,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:39:26,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:39:26,665 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:39:26,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:25" (3/4) ... [2019-11-28 20:39:26,669 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:39:26,726 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:39:26,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:39:26,729 INFO L168 Benchmark]: Toolchain (without parser) took 1768.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 960.4 MB in the beginning and 987.9 MB in the end (delta: -27.6 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:26,730 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:26,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:26,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.57 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:26,732 INFO L168 Benchmark]: Boogie Preprocessor took 86.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:26,733 INFO L168 Benchmark]: RCFGBuilder took 301.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:26,733 INFO L168 Benchmark]: BuchiAutomizer took 1025.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:26,734 INFO L168 Benchmark]: Witness Printer took 61.90 ms. Allocated memory is still 1.1 GB. Free memory is still 987.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:26,737 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.57 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 301.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1025.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * Witness Printer took 61.90 ms. Allocated memory is still 1.1 GB. Free memory is still 987.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 241 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 241 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 173 SDtfs, 89 SDslu, 96 SDs, 0 SdLazy, 20 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 24]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45d5254d=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bb1fdb4=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@323be824=1, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a1a9219=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cccbbf5=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f9f0980=0, cond=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 24]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L22] int cond; Loop: [L24] COND TRUE 1 [L25] cond = __VERIFIER_nondet_int() [L26] COND FALSE !(cond == 0) [L29] lk1 = 0 [L31] lk2 = 0 [L33] lk3 = 0 [L35] lk4 = 0 [L37] lk5 = 0 [L41] COND FALSE !(p1 != 0) [L45] COND FALSE !(p2 != 0) [L49] COND FALSE !(p3 != 0) [L53] COND FALSE !(p4 != 0) [L57] COND FALSE !(p5 != 0) [L63] COND FALSE !(p1 != 0) [L68] COND FALSE !(p2 != 0) [L73] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L83] COND FALSE !(p5 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...