./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd6d122756047ddb1225c106ac06a6748e14c22 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-aa41828 [2018-11-23 06:36:15,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:36:15,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:36:15,061 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:36:15,061 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:36:15,062 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:36:15,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:36:15,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:36:15,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:36:15,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:36:15,066 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:36:15,066 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:36:15,066 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:36:15,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:36:15,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:36:15,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:36:15,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:36:15,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:36:15,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:36:15,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:36:15,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:36:15,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:36:15,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:36:15,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:36:15,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:36:15,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:36:15,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:36:15,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:36:15,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:36:15,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:36:15,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:36:15,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:36:15,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:36:15,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:36:15,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:36:15,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:36:15,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:36:15,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:36:15,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:36:15,090 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:36:15,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:36:15,090 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:36:15,091 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:36:15,091 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:36:15,091 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:36:15,091 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:36:15,091 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:36:15,091 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:36:15,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:36:15,092 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:36:15,093 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:36:15,093 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:36:15,093 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:36:15,093 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:36:15,093 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:36:15,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:36:15,093 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:36:15,094 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:36:15,094 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:36:15,094 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:36:15,094 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:36:15,094 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:36:15,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:36:15,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:36:15,095 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:36:15,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:36:15,095 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:36:15,095 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:36:15,096 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:36:15,096 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-23 06:36:15,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:36:15,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:36:15,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:36:15,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:36:15,133 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:36:15,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 06:36:15,172 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/data/48132fb85/371cc3427c5a4518a268fd95e761dc0a/FLAG94efa799b [2018-11-23 06:36:15,470 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:36:15,470 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 06:36:15,474 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/data/48132fb85/371cc3427c5a4518a268fd95e761dc0a/FLAG94efa799b [2018-11-23 06:36:15,485 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/data/48132fb85/371cc3427c5a4518a268fd95e761dc0a [2018-11-23 06:36:15,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:36:15,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:36:15,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:36:15,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:36:15,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:36:15,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15, skipping insertion in model container [2018-11-23 06:36:15,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:36:15,513 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:36:15,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:36:15,628 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:36:15,643 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:36:15,651 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:36:15,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15 WrapperNode [2018-11-23 06:36:15,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:36:15,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:36:15,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:36:15,652 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:36:15,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:36:15,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:36:15,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:36:15,674 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:36:15,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... [2018-11-23 06:36:15,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:36:15,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:36:15,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:36:15,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:36:15,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:36:15,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:36:15,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:36:15,884 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:36:15,884 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 06:36:15,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:36:15 BoogieIcfgContainer [2018-11-23 06:36:15,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:36:15,885 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:36:15,885 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:36:15,888 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:36:15,888 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:36:15,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:36:15" (1/3) ... [2018-11-23 06:36:15,890 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9b8d702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:36:15, skipping insertion in model container [2018-11-23 06:36:15,890 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:36:15,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:36:15" (2/3) ... [2018-11-23 06:36:15,890 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9b8d702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:36:15, skipping insertion in model container [2018-11-23 06:36:15,890 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:36:15,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:36:15" (3/3) ... [2018-11-23 06:36:15,892 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 06:36:15,931 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:36:15,931 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:36:15,931 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:36:15,931 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:36:15,931 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:36:15,932 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:36:15,932 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:36:15,932 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:36:15,932 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:36:15,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-23 06:36:15,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 06:36:15,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:15,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:15,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:15,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:15,960 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:36:15,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-23 06:36:15,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 06:36:15,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:15,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:15,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:15,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:15,967 INFO L794 eck$LassoCheckResult]: Stem: 28#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_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; 18#L111-1true [2018-11-23 06:36:15,967 INFO L796 eck$LassoCheckResult]: Loop: 18#L111-1true assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 11#L32true 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;main_~lk6~0 := 0;main_~lk7~0 := 0; 8#L51true assume 0 != main_~p1~0;main_~lk1~0 := 1; 6#L51-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 29#L55-1true assume !(0 != main_~p3~0); 20#L59-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 24#L63-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 15#L67-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 4#L71-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 25#L75-1true assume !(0 != main_~p1~0); 21#L81-1true assume !(0 != main_~p2~0); 27#L86-1true assume !(0 != main_~p3~0); 3#L91-1true assume !(0 != main_~p4~0); 10#L96-1true assume !(0 != main_~p5~0); 31#L101-1true assume !(0 != main_~p6~0); 9#L106-1true assume !(0 != main_~p7~0); 18#L111-1true [2018-11-23 06:36:15,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:15,972 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 06:36:15,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:15,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1253571452, now seen corresponding path program 1 times [2018-11-23 06:36:16,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:16,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:16,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:36:16,086 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:36:16,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:36:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:36:16,098 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-23 06:36:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:16,120 INFO L93 Difference]: Finished difference Result 56 states and 93 transitions. [2018-11-23 06:36:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:36:16,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 93 transitions. [2018-11-23 06:36:16,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2018-11-23 06:36:16,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 46 states and 72 transitions. [2018-11-23 06:36:16,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-23 06:36:16,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-23 06:36:16,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 72 transitions. [2018-11-23 06:36:16,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:16,130 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2018-11-23 06:36:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 72 transitions. [2018-11-23 06:36:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 06:36:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 06:36:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2018-11-23 06:36:16,152 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2018-11-23 06:36:16,152 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 72 transitions. [2018-11-23 06:36:16,152 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:36:16,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 72 transitions. [2018-11-23 06:36:16,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2018-11-23 06:36:16,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:16,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:16,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:16,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:16,154 INFO L794 eck$LassoCheckResult]: Stem: 119#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_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; 120#L111-1 [2018-11-23 06:36:16,154 INFO L796 eck$LassoCheckResult]: Loop: 120#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 128#L32 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;main_~lk6~0 := 0;main_~lk7~0 := 0; 127#L51 assume !(0 != main_~p1~0); 108#L51-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 109#L55-1 assume !(0 != main_~p3~0); 97#L59-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 98#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 122#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 106#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 107#L75-1 assume !(0 != main_~p1~0); 123#L81-1 assume !(0 != main_~p2~0); 138#L86-1 assume !(0 != main_~p3~0); 136#L91-1 assume !(0 != main_~p4~0); 134#L96-1 assume !(0 != main_~p5~0); 132#L101-1 assume !(0 != main_~p6~0); 130#L106-1 assume !(0 != main_~p7~0); 120#L111-1 [2018-11-23 06:36:16,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-23 06:36:16,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2030278594, now seen corresponding path program 1 times [2018-11-23 06:36:16,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:16,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:16,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:36:16,186 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:36:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:36:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:36:16,186 INFO L87 Difference]: Start difference. First operand 46 states and 72 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-23 06:36:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:16,202 INFO L93 Difference]: Finished difference Result 89 states and 137 transitions. [2018-11-23 06:36:16,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:36:16,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 137 transitions. [2018-11-23 06:36:16,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2018-11-23 06:36:16,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 137 transitions. [2018-11-23 06:36:16,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-23 06:36:16,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-11-23 06:36:16,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 137 transitions. [2018-11-23 06:36:16,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:16,206 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2018-11-23 06:36:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 137 transitions. [2018-11-23 06:36:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-23 06:36:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 06:36:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2018-11-23 06:36:16,211 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2018-11-23 06:36:16,211 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 137 transitions. [2018-11-23 06:36:16,211 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:36:16,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 137 transitions. [2018-11-23 06:36:16,212 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2018-11-23 06:36:16,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:16,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:16,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:16,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:16,213 INFO L794 eck$LassoCheckResult]: Stem: 258#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_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; 243#L111-1 [2018-11-23 06:36:16,213 INFO L796 eck$LassoCheckResult]: Loop: 243#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 259#L32 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;main_~lk6~0 := 0;main_~lk7~0 := 0; 260#L51 assume !(0 != main_~p1~0); 264#L51-2 assume !(0 != main_~p2~0); 262#L55-1 assume !(0 != main_~p3~0); 235#L59-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 236#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 254#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 302#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 301#L75-1 assume !(0 != main_~p1~0); 299#L81-1 assume !(0 != main_~p2~0); 298#L86-1 assume !(0 != main_~p3~0); 237#L91-1 assume !(0 != main_~p4~0); 238#L96-1 assume !(0 != main_~p5~0); 247#L101-1 assume !(0 != main_~p6~0); 255#L106-1 assume !(0 != main_~p7~0); 243#L111-1 [2018-11-23 06:36:16,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-23 06:36:16,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1443472580, now seen corresponding path program 1 times [2018-11-23 06:36:16,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:16,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:16,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:36:16,235 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:36:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:36:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:36:16,235 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. cyclomatic complexity: 52 Second operand 3 states. [2018-11-23 06:36:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:16,249 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2018-11-23 06:36:16,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:36:16,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 261 transitions. [2018-11-23 06:36:16,251 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2018-11-23 06:36:16,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 261 transitions. [2018-11-23 06:36:16,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2018-11-23 06:36:16,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2018-11-23 06:36:16,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 261 transitions. [2018-11-23 06:36:16,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:16,254 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2018-11-23 06:36:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 261 transitions. [2018-11-23 06:36:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-11-23 06:36:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-23 06:36:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2018-11-23 06:36:16,265 INFO L728 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2018-11-23 06:36:16,265 INFO L608 BuchiCegarLoop]: Abstraction has 173 states and 261 transitions. [2018-11-23 06:36:16,266 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:36:16,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 261 transitions. [2018-11-23 06:36:16,267 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2018-11-23 06:36:16,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:16,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:16,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:16,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:16,268 INFO L794 eck$LassoCheckResult]: Stem: 525#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_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; 526#L111-1 [2018-11-23 06:36:16,268 INFO L796 eck$LassoCheckResult]: Loop: 526#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 586#L32 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;main_~lk6~0 := 0;main_~lk7~0 := 0; 540#L51 assume !(0 != main_~p1~0); 541#L51-2 assume !(0 != main_~p2~0); 619#L55-1 assume !(0 != main_~p3~0); 618#L59-1 assume !(0 != main_~p4~0); 576#L63-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 577#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 570#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 571#L75-1 assume !(0 != main_~p1~0); 606#L81-1 assume !(0 != main_~p2~0); 603#L86-1 assume !(0 != main_~p3~0); 598#L91-1 assume !(0 != main_~p4~0); 596#L96-1 assume !(0 != main_~p5~0); 593#L101-1 assume !(0 != main_~p6~0); 588#L106-1 assume !(0 != main_~p7~0); 526#L111-1 [2018-11-23 06:36:16,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,268 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-11-23 06:36:16,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2144537158, now seen corresponding path program 1 times [2018-11-23 06:36:16,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:16,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:16,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:16,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:36:16,294 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:36:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:36:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:36:16,294 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. cyclomatic complexity: 96 Second operand 3 states. [2018-11-23 06:36:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:16,314 INFO L93 Difference]: Finished difference Result 337 states and 497 transitions. [2018-11-23 06:36:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:36:16,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 497 transitions. [2018-11-23 06:36:16,316 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2018-11-23 06:36:16,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 337 states and 497 transitions. [2018-11-23 06:36:16,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2018-11-23 06:36:16,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2018-11-23 06:36:16,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 497 transitions. [2018-11-23 06:36:16,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:16,321 INFO L705 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2018-11-23 06:36:16,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 497 transitions. [2018-11-23 06:36:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-11-23 06:36:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-23 06:36:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 497 transitions. [2018-11-23 06:36:16,335 INFO L728 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2018-11-23 06:36:16,335 INFO L608 BuchiCegarLoop]: Abstraction has 337 states and 497 transitions. [2018-11-23 06:36:16,335 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:36:16,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 337 states and 497 transitions. [2018-11-23 06:36:16,337 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2018-11-23 06:36:16,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:16,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:16,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:16,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:16,337 INFO L794 eck$LassoCheckResult]: Stem: 1044#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_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; 1045#L111-1 [2018-11-23 06:36:16,338 INFO L796 eck$LassoCheckResult]: Loop: 1045#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 1190#L32 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;main_~lk6~0 := 0;main_~lk7~0 := 0; 1197#L51 assume !(0 != main_~p1~0); 1195#L51-2 assume !(0 != main_~p2~0); 1133#L55-1 assume !(0 != main_~p3~0); 1134#L59-1 assume !(0 != main_~p4~0); 1119#L63-1 assume !(0 != main_~p5~0); 1121#L67-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1105#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1106#L75-1 assume !(0 != main_~p1~0); 1187#L81-1 assume !(0 != main_~p2~0); 1189#L86-1 assume !(0 != main_~p3~0); 1210#L91-1 assume !(0 != main_~p4~0); 1209#L96-1 assume !(0 != main_~p5~0); 1208#L101-1 assume !(0 != main_~p6~0); 1203#L106-1 assume !(0 != main_~p7~0); 1045#L111-1 [2018-11-23 06:36:16,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-11-23 06:36:16,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1751510148, now seen corresponding path program 1 times [2018-11-23 06:36:16,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:16,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:16,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:36:16,358 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:36:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:36:16,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:36:16,358 INFO L87 Difference]: Start difference. First operand 337 states and 497 transitions. cyclomatic complexity: 176 Second operand 3 states. [2018-11-23 06:36:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:16,397 INFO L93 Difference]: Finished difference Result 657 states and 945 transitions. [2018-11-23 06:36:16,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:36:16,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 657 states and 945 transitions. [2018-11-23 06:36:16,403 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2018-11-23 06:36:16,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 657 states to 657 states and 945 transitions. [2018-11-23 06:36:16,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 657 [2018-11-23 06:36:16,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 657 [2018-11-23 06:36:16,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 657 states and 945 transitions. [2018-11-23 06:36:16,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:16,408 INFO L705 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2018-11-23 06:36:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states and 945 transitions. [2018-11-23 06:36:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2018-11-23 06:36:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-23 06:36:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 945 transitions. [2018-11-23 06:36:16,423 INFO L728 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2018-11-23 06:36:16,423 INFO L608 BuchiCegarLoop]: Abstraction has 657 states and 945 transitions. [2018-11-23 06:36:16,423 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:36:16,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 945 transitions. [2018-11-23 06:36:16,426 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2018-11-23 06:36:16,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:16,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:16,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:16,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:16,427 INFO L794 eck$LassoCheckResult]: Stem: 2042#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_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; 2043#L111-1 [2018-11-23 06:36:16,427 INFO L796 eck$LassoCheckResult]: Loop: 2043#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 2126#L32 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;main_~lk6~0 := 0;main_~lk7~0 := 0; 2122#L51 assume !(0 != main_~p1~0); 2118#L51-2 assume !(0 != main_~p2~0); 2116#L55-1 assume !(0 != main_~p3~0); 2114#L59-1 assume !(0 != main_~p4~0); 2110#L63-1 assume !(0 != main_~p5~0); 2106#L67-1 assume !(0 != main_~p6~0); 2104#L71-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2100#L75-1 assume !(0 != main_~p1~0); 2096#L81-1 assume !(0 != main_~p2~0); 2093#L86-1 assume !(0 != main_~p3~0); 2089#L91-1 assume !(0 != main_~p4~0); 2090#L96-1 assume !(0 != main_~p5~0); 2133#L101-1 assume !(0 != main_~p6~0); 2130#L106-1 assume !(0 != main_~p7~0); 2043#L111-1 [2018-11-23 06:36:16,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-11-23 06:36:16,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1863398778, now seen corresponding path program 1 times [2018-11-23 06:36:16,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:16,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:36:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:36:16,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:36:16,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:36:16,458 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:36:16,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:36:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:36:16,458 INFO L87 Difference]: Start difference. First operand 657 states and 945 transitions. cyclomatic complexity: 320 Second operand 3 states. [2018-11-23 06:36:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:16,489 INFO L93 Difference]: Finished difference Result 1281 states and 1793 transitions. [2018-11-23 06:36:16,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:36:16,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1281 states and 1793 transitions. [2018-11-23 06:36:16,496 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2018-11-23 06:36:16,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1281 states to 1281 states and 1793 transitions. [2018-11-23 06:36:16,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1281 [2018-11-23 06:36:16,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1281 [2018-11-23 06:36:16,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1281 states and 1793 transitions. [2018-11-23 06:36:16,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:36:16,504 INFO L705 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2018-11-23 06:36:16,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states and 1793 transitions. [2018-11-23 06:36:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1281. [2018-11-23 06:36:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2018-11-23 06:36:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1793 transitions. [2018-11-23 06:36:16,526 INFO L728 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2018-11-23 06:36:16,526 INFO L608 BuchiCegarLoop]: Abstraction has 1281 states and 1793 transitions. [2018-11-23 06:36:16,526 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:36:16,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1281 states and 1793 transitions. [2018-11-23 06:36:16,531 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2018-11-23 06:36:16,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:36:16,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:36:16,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:36:16,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:16,532 INFO L794 eck$LassoCheckResult]: Stem: 3988#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_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; 3989#L111-1 [2018-11-23 06:36:16,532 INFO L796 eck$LassoCheckResult]: Loop: 3989#L111-1 assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; 4197#L32 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;main_~lk6~0 := 0;main_~lk7~0 := 0; 4193#L51 assume !(0 != main_~p1~0); 4190#L51-2 assume !(0 != main_~p2~0); 4187#L55-1 assume !(0 != main_~p3~0); 4185#L59-1 assume !(0 != main_~p4~0); 4183#L63-1 assume !(0 != main_~p5~0); 4177#L67-1 assume !(0 != main_~p6~0); 4178#L71-1 assume !(0 != main_~p7~0); 4212#L75-1 assume !(0 != main_~p1~0); 4363#L81-1 assume !(0 != main_~p2~0); 4360#L86-1 assume !(0 != main_~p3~0); 4137#L91-1 assume !(0 != main_~p4~0); 4138#L96-1 assume !(0 != main_~p5~0); 4103#L101-1 assume !(0 != main_~p6~0); 4104#L106-1 assume !(0 != main_~p7~0); 3989#L111-1 [2018-11-23 06:36:16,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-11-23 06:36:16,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1622221892, now seen corresponding path program 1 times [2018-11-23 06:36:16,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash 625149539, now seen corresponding path program 1 times [2018-11-23 06:36:16,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:16,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:36:16,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; [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; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L28] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; [?] 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;main_~lk6~0 := 0;main_~lk7~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) ----- [2018-11-23 06:36:16,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:36:16 BoogieIcfgContainer [2018-11-23 06:36:16,647 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:36:16,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:36:16,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:36:16,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:36:16,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:36:15" (3/4) ... [2018-11-23 06:36:16,651 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; [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; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L28] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; [?] 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;main_~lk6~0 := 0;main_~lk7~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) ----- [2018-11-23 06:36:16,695 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_be206764-1296-4a15-b1f9-b5586ed04945/bin-2019/uautomizer/witness.graphml [2018-11-23 06:36:16,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:36:16,696 INFO L168 Benchmark]: Toolchain (without parser) took 1207.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -79.8 MB). Peak memory consumption was 90.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:16,698 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:16,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:16,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.67 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:16,699 INFO L168 Benchmark]: Boogie Preprocessor took 55.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -222.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:16,699 INFO L168 Benchmark]: RCFGBuilder took 154.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:16,700 INFO L168 Benchmark]: BuchiAutomizer took 762.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 107.9 MB). Peak memory consumption was 107.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:16,700 INFO L168 Benchmark]: Witness Printer took 48.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:16,702 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 21.67 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -222.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 154.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 762.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 107.9 MB). Peak memory consumption was 107.9 MB. Max. memory is 11.5 GB. * Witness Printer took 48.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1281 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 344 SDtfs, 179 SDslu, 202 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI6 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: 30]: 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, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49b42e77=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7db49bf0=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43228dc9=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cae419b=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10864c8c=0, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14a551ae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@445d6fd1=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ff274c6=0, cond=1, lk7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; [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; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L28] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; [?] 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;main_~lk6~0 := 0;main_~lk7~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~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;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, 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_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L28] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L28] havoc ~cond~0; [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; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L28] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet7;havoc main_#t~nondet7; [?] 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;main_~lk6~0 := 0;main_~lk7~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p7~0); [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L30-L116] assume !false; [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32-L34] assume !(0 == main_~cond~0); [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51-L53] assume !(0 != main_~p1~0); [L55-L57] assume !(0 != main_~p2~0); [L59-L61] assume !(0 != main_~p3~0); [L63-L65] assume !(0 != main_~p4~0); [L67-L69] assume !(0 != main_~p5~0); [L71-L73] assume !(0 != main_~p6~0); [L75-L77] assume !(0 != main_~p7~0); [L81-L84] assume !(0 != main_~p1~0); [L86-L89] assume !(0 != main_~p2~0); [L91-L94] assume !(0 != main_~p3~0); [L96-L99] assume !(0 != main_~p4~0); [L101-L104] assume !(0 != main_~p5~0); [L106-L109] assume !(0 != main_~p6~0); [L111-L114] assume !(0 != main_~p7~0); [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L30-L116] COND FALSE !(false) [L31] main_~cond~0 := main_#t~nondet7; [L31] havoc main_#t~nondet7; [L32] COND FALSE !(0 == main_~cond~0) [L35] main_~lk1~0 := 0; [L37] main_~lk2~0 := 0; [L39] main_~lk3~0 := 0; [L41] main_~lk4~0 := 0; [L43] main_~lk5~0 := 0; [L45] main_~lk6~0 := 0; [L47] main_~lk7~0 := 0; [L51] COND FALSE !(0 != main_~p1~0) [L55] COND FALSE !(0 != main_~p2~0) [L59] COND FALSE !(0 != main_~p3~0) [L63] COND FALSE !(0 != main_~p4~0) [L67] COND FALSE !(0 != main_~p5~0) [L71] COND FALSE !(0 != main_~p6~0) [L75] COND FALSE !(0 != main_~p7~0) [L81] COND FALSE !(0 != main_~p1~0) [L86] COND FALSE !(0 != main_~p2~0) [L91] COND FALSE !(0 != main_~p3~0) [L96] COND FALSE !(0 != main_~p4~0) [L101] COND FALSE !(0 != main_~p5~0) [L106] COND FALSE !(0 != main_~p6~0) [L111] COND FALSE !(0 != main_~p7~0) [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L30-L116] COND FALSE !(false) [L31] ~cond~0 := #t~nondet7; [L31] havoc #t~nondet7; [L32] COND FALSE !(0 == ~cond~0) [L35] ~lk1~0 := 0; [L37] ~lk2~0 := 0; [L39] ~lk3~0 := 0; [L41] ~lk4~0 := 0; [L43] ~lk5~0 := 0; [L45] ~lk6~0 := 0; [L47] ~lk7~0 := 0; [L51] COND FALSE !(0 != ~p1~0) [L55] COND FALSE !(0 != ~p2~0) [L59] COND FALSE !(0 != ~p3~0) [L63] COND FALSE !(0 != ~p4~0) [L67] COND FALSE !(0 != ~p5~0) [L71] COND FALSE !(0 != ~p6~0) [L75] COND FALSE !(0 != ~p7~0) [L81] COND FALSE !(0 != ~p1~0) [L86] COND FALSE !(0 != ~p2~0) [L91] COND FALSE !(0 != ~p3~0) [L96] COND FALSE !(0 != ~p4~0) [L101] COND FALSE !(0 != ~p5~0) [L106] COND FALSE !(0 != ~p6~0) [L111] COND FALSE !(0 != ~p7~0) [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) ----- 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; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L28] int cond; Loop: [L30] COND TRUE 1 [L31] cond = __VERIFIER_nondet_int() [L32] COND FALSE !(cond == 0) [L35] lk1 = 0 [L37] lk2 = 0 [L39] lk3 = 0 [L41] lk4 = 0 [L43] lk5 = 0 [L45] lk6 = 0 [L47] lk7 = 0 [L51] COND FALSE !(p1 != 0) [L55] COND FALSE !(p2 != 0) [L59] COND FALSE !(p3 != 0) [L63] COND FALSE !(p4 != 0) [L67] COND FALSE !(p5 != 0) [L71] COND FALSE !(p6 != 0) [L75] COND FALSE !(p7 != 0) [L81] COND FALSE !(p1 != 0) [L86] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L96] COND FALSE !(p4 != 0) [L101] COND FALSE !(p5 != 0) [L106] COND FALSE !(p6 != 0) [L111] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...