./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:12:13,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:12:13,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:12:13,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:12:13,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:12:13,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:12:13,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:12:13,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:12:13,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:12:13,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:12:13,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:12:13,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:12:13,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:12:13,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:12:13,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:12:13,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:12:13,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:12:13,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:12:13,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:12:13,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:12:13,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:12:13,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:12:13,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:12:13,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:12:13,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:12:13,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:12:13,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:12:13,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:12:13,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:12:13,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:12:13,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:12:13,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:12:13,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:12:13,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:12:13,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:12:13,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:12:13,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:12:13,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:12:13,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:12:13,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:12:13,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:12:13,140 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 10:12:13,169 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:12:13,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:12:13,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:12:13,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:12:13,171 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:12:13,171 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 10:12:13,171 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 10:12:13,171 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 10:12:13,171 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 10:12:13,172 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 10:12:13,172 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 10:12:13,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:12:13,172 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:12:13,172 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 10:12:13,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:12:13,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:12:13,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:12:13,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 10:12:13,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 10:12:13,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 10:12:13,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:12:13,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:12:13,174 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 10:12:13,174 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:12:13,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 10:12:13,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:12:13,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:12:13,175 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 10:12:13,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:12:13,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:12:13,176 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 10:12:13,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 10:12:13,177 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-11-20 10:12:13,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:12:13,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:12:13,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:12:13,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:12:13,396 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:12:13,396 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_13.c [2019-11-20 10:12:13,471 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/data/dcc1354c7/1f3ac82e04cf405aac1b227fd9e62345/FLAG93bfe8f62 [2019-11-20 10:12:13,856 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:12:13,856 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/sv-benchmarks/c/locks/test_locks_13.c [2019-11-20 10:12:13,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/data/dcc1354c7/1f3ac82e04cf405aac1b227fd9e62345/FLAG93bfe8f62 [2019-11-20 10:12:14,267 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/data/dcc1354c7/1f3ac82e04cf405aac1b227fd9e62345 [2019-11-20 10:12:14,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:12:14,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:12:14,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:12:14,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:12:14,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:12:14,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581975cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14, skipping insertion in model container [2019-11-20 10:12:14,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,288 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:12:14,315 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:12:14,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:12:14,637 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:12:14,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:12:14,688 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:12:14,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14 WrapperNode [2019-11-20 10:12:14,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:12:14,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:12:14,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:12:14,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:12:14,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:12:14,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:12:14,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:12:14,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:12:14,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... [2019-11-20 10:12:14,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:12:14,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:12:14,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:12:14,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:12:14,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/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 [2019-11-20 10:12:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:12:14,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:12:15,146 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:12:15,146 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 10:12:15,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:12:15 BoogieIcfgContainer [2019-11-20 10:12:15,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:12:15,148 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 10:12:15,149 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 10:12:15,152 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 10:12:15,153 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:12:15,153 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:12:14" (1/3) ... [2019-11-20 10:12:15,154 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50088dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:12:15, skipping insertion in model container [2019-11-20 10:12:15,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:12:15,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:12:14" (2/3) ... [2019-11-20 10:12:15,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50088dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:12:15, skipping insertion in model container [2019-11-20 10:12:15,155 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:12:15,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:12:15" (3/3) ... [2019-11-20 10:12:15,156 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2019-11-20 10:12:15,203 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 10:12:15,203 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 10:12:15,203 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 10:12:15,205 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:12:15,205 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:12:15,205 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 10:12:15,206 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:12:15,206 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 10:12:15,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2019-11-20 10:12:15,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-20 10:12:15,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:15,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:15,247 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:15,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:15,247 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 10:12:15,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2019-11-20 10:12:15,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-20 10:12:15,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:15,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:15,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:15,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:15,259 INFO L794 eck$LassoCheckResult]: Stem: 40#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 23#L195-1true [2019-11-20 10:12:15,260 INFO L796 eck$LassoCheckResult]: Loop: 23#L195-1true assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 33#L50true 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 30#L81true assume 0 != main_~p1~0;main_~lk1~0 := 1; 27#L81-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 37#L85-1true assume !(0 != main_~p3~0); 24#L89-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 8#L93-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 41#L97-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 47#L101-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 34#L105-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 20#L109-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 5#L113-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 13#L117-1true assume !(0 != main_~p11~0); 44#L121-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 31#L125-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 16#L129-1true assume !(0 != main_~p1~0); 6#L135-1true assume !(0 != main_~p2~0); 17#L140-1true assume !(0 != main_~p3~0); 28#L145-1true assume !(0 != main_~p4~0); 38#L150-1true assume !(0 != main_~p5~0); 3#L155-1true assume !(0 != main_~p6~0); 14#L160-1true assume !(0 != main_~p7~0); 48#L165-1true assume !(0 != main_~p8~0); 12#L170-1true assume !(0 != main_~p9~0); 26#L175-1true assume !(0 != main_~p10~0); 36#L180-1true assume !(0 != main_~p11~0); 45#L185-1true assume !(0 != main_~p12~0); 10#L190-1true assume !(0 != main_~p13~0); 23#L195-1true [2019-11-20 10:12:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-20 10:12:15,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852650630] [2019-11-20 10:12:15,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:15,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,374 INFO L82 PathProgramCache]: Analyzing trace with hash -391818443, now seen corresponding path program 1 times [2019-11-20 10:12:15,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015233529] [2019-11-20 10:12:15,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:15,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015233529] [2019-11-20 10:12:15,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:15,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:15,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008222782] [2019-11-20 10:12:15,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:15,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:15,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:15,497 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-11-20 10:12:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:15,547 INFO L93 Difference]: Finished difference Result 92 states and 165 transitions. [2019-11-20 10:12:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:15,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 165 transitions. [2019-11-20 10:12:15,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-11-20 10:12:15,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 82 states and 132 transitions. [2019-11-20 10:12:15,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2019-11-20 10:12:15,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2019-11-20 10:12:15,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 132 transitions. [2019-11-20 10:12:15,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:15,566 INFO L688 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-11-20 10:12:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 132 transitions. [2019-11-20 10:12:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-20 10:12:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 10:12:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 132 transitions. [2019-11-20 10:12:15,598 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-11-20 10:12:15,599 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 132 transitions. [2019-11-20 10:12:15,599 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 10:12:15,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 132 transitions. [2019-11-20 10:12:15,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-11-20 10:12:15,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:15,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:15,603 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:15,603 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:15,603 INFO L794 eck$LassoCheckResult]: Stem: 198#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 199#L195-1 [2019-11-20 10:12:15,604 INFO L796 eck$LassoCheckResult]: Loop: 199#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 191#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 192#L81 assume !(0 != main_~p1~0); 205#L81-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 229#L85-1 assume !(0 != main_~p3~0); 228#L89-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 227#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 226#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 225#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 193#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 194#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 224#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 223#L117-1 assume !(0 != main_~p11~0); 202#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 203#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 222#L129-1 assume !(0 != main_~p1~0); 155#L135-1 assume !(0 != main_~p2~0); 156#L140-1 assume !(0 != main_~p3~0); 186#L145-1 assume !(0 != main_~p4~0); 179#L150-1 assume !(0 != main_~p5~0); 150#L155-1 assume !(0 != main_~p6~0); 152#L160-1 assume !(0 != main_~p7~0); 159#L165-1 assume !(0 != main_~p8~0); 176#L170-1 assume !(0 != main_~p9~0); 211#L175-1 assume !(0 != main_~p10~0); 196#L180-1 assume !(0 != main_~p11~0); 149#L185-1 assume !(0 != main_~p12~0); 207#L190-1 assume !(0 != main_~p13~0); 199#L195-1 [2019-11-20 10:12:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-20 10:12:15,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464099810] [2019-11-20 10:12:15,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,620 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash -329778829, now seen corresponding path program 1 times [2019-11-20 10:12:15,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440105396] [2019-11-20 10:12:15,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:15,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440105396] [2019-11-20 10:12:15,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:15,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642655742] [2019-11-20 10:12:15,683 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:15,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:15,684 INFO L87 Difference]: Start difference. First operand 82 states and 132 transitions. cyclomatic complexity: 52 Second operand 3 states. [2019-11-20 10:12:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:15,712 INFO L93 Difference]: Finished difference Result 161 states and 257 transitions. [2019-11-20 10:12:15,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:15,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 257 transitions. [2019-11-20 10:12:15,717 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2019-11-20 10:12:15,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 161 states and 257 transitions. [2019-11-20 10:12:15,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2019-11-20 10:12:15,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2019-11-20 10:12:15,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 257 transitions. [2019-11-20 10:12:15,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:15,723 INFO L688 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-11-20 10:12:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 257 transitions. [2019-11-20 10:12:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-20 10:12:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-20 10:12:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 257 transitions. [2019-11-20 10:12:15,739 INFO L711 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-11-20 10:12:15,739 INFO L591 BuchiCegarLoop]: Abstraction has 161 states and 257 transitions. [2019-11-20 10:12:15,739 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 10:12:15,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 257 transitions. [2019-11-20 10:12:15,743 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2019-11-20 10:12:15,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:15,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:15,744 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:15,744 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:15,744 INFO L794 eck$LassoCheckResult]: Stem: 443#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 444#L195-1 [2019-11-20 10:12:15,745 INFO L796 eck$LassoCheckResult]: Loop: 444#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 456#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 453#L81 assume !(0 != main_~p1~0); 454#L81-2 assume !(0 != main_~p2~0); 517#L85-1 assume !(0 != main_~p3~0); 516#L89-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 515#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 514#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 513#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 512#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 511#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 510#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 509#L117-1 assume !(0 != main_~p11~0); 508#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 507#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 505#L129-1 assume !(0 != main_~p1~0); 503#L135-1 assume !(0 != main_~p2~0); 501#L140-1 assume !(0 != main_~p3~0); 497#L145-1 assume !(0 != main_~p4~0); 493#L150-1 assume !(0 != main_~p5~0); 489#L155-1 assume !(0 != main_~p6~0); 485#L160-1 assume !(0 != main_~p7~0); 481#L165-1 assume !(0 != main_~p8~0); 477#L170-1 assume !(0 != main_~p9~0); 473#L175-1 assume !(0 != main_~p10~0); 469#L180-1 assume !(0 != main_~p11~0); 464#L185-1 assume !(0 != main_~p12~0); 461#L190-1 assume !(0 != main_~p13~0); 444#L195-1 [2019-11-20 10:12:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,745 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-20 10:12:15,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204933365] [2019-11-20 10:12:15,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash -189230219, now seen corresponding path program 1 times [2019-11-20 10:12:15,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993771128] [2019-11-20 10:12:15,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:15,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993771128] [2019-11-20 10:12:15,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:15,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:15,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343011528] [2019-11-20 10:12:15,837 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:15,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:15,837 INFO L87 Difference]: Start difference. First operand 161 states and 257 transitions. cyclomatic complexity: 100 Second operand 3 states. [2019-11-20 10:12:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:15,871 INFO L93 Difference]: Finished difference Result 317 states and 501 transitions. [2019-11-20 10:12:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:15,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 501 transitions. [2019-11-20 10:12:15,878 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2019-11-20 10:12:15,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 317 states and 501 transitions. [2019-11-20 10:12:15,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2019-11-20 10:12:15,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2019-11-20 10:12:15,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 501 transitions. [2019-11-20 10:12:15,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:15,888 INFO L688 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-11-20 10:12:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 501 transitions. [2019-11-20 10:12:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-11-20 10:12:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-20 10:12:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 501 transitions. [2019-11-20 10:12:15,917 INFO L711 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-11-20 10:12:15,917 INFO L591 BuchiCegarLoop]: Abstraction has 317 states and 501 transitions. [2019-11-20 10:12:15,917 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 10:12:15,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 501 transitions. [2019-11-20 10:12:15,920 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2019-11-20 10:12:15,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:15,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:15,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:15,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:15,921 INFO L794 eck$LassoCheckResult]: Stem: 929#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 930#L195-1 [2019-11-20 10:12:15,922 INFO L796 eck$LassoCheckResult]: Loop: 930#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 975#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 973#L81 assume !(0 != main_~p1~0); 969#L81-2 assume !(0 != main_~p2~0); 967#L85-1 assume !(0 != main_~p3~0); 964#L89-1 assume !(0 != main_~p4~0); 962#L93-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 960#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 958#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 956#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 954#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 952#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 950#L117-1 assume !(0 != main_~p11~0); 948#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 946#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 943#L129-1 assume !(0 != main_~p1~0); 944#L135-1 assume !(0 != main_~p2~0); 1019#L140-1 assume !(0 != main_~p3~0); 1014#L145-1 assume !(0 != main_~p4~0); 1011#L150-1 assume !(0 != main_~p5~0); 1007#L155-1 assume !(0 != main_~p6~0); 1003#L160-1 assume !(0 != main_~p7~0); 999#L165-1 assume !(0 != main_~p8~0); 995#L170-1 assume !(0 != main_~p9~0); 991#L175-1 assume !(0 != main_~p10~0); 987#L180-1 assume !(0 != main_~p11~0); 982#L185-1 assume !(0 != main_~p12~0); 979#L190-1 assume !(0 != main_~p13~0); 930#L195-1 [2019-11-20 10:12:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-20 10:12:15,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268528408] [2019-11-20 10:12:15,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:15,933 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:15,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1994668553, now seen corresponding path program 1 times [2019-11-20 10:12:15,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:15,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947929272] [2019-11-20 10:12:15,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:15,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947929272] [2019-11-20 10:12:15,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:15,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:15,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948669452] [2019-11-20 10:12:15,968 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:15,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:15,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:15,969 INFO L87 Difference]: Start difference. First operand 317 states and 501 transitions. cyclomatic complexity: 192 Second operand 3 states. [2019-11-20 10:12:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:15,991 INFO L93 Difference]: Finished difference Result 625 states and 977 transitions. [2019-11-20 10:12:15,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:15,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 625 states and 977 transitions. [2019-11-20 10:12:16,000 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2019-11-20 10:12:16,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 625 states to 625 states and 977 transitions. [2019-11-20 10:12:16,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 625 [2019-11-20 10:12:16,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 625 [2019-11-20 10:12:16,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 625 states and 977 transitions. [2019-11-20 10:12:16,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:16,014 INFO L688 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-11-20 10:12:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states and 977 transitions. [2019-11-20 10:12:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-11-20 10:12:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-11-20 10:12:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 977 transitions. [2019-11-20 10:12:16,048 INFO L711 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-11-20 10:12:16,049 INFO L591 BuchiCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-11-20 10:12:16,049 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 10:12:16,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 625 states and 977 transitions. [2019-11-20 10:12:16,062 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2019-11-20 10:12:16,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:16,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:16,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:16,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:16,066 INFO L794 eck$LassoCheckResult]: Stem: 1873#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 1874#L195-1 [2019-11-20 10:12:16,066 INFO L796 eck$LassoCheckResult]: Loop: 1874#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 2094#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 2093#L81 assume !(0 != main_~p1~0); 2090#L81-2 assume !(0 != main_~p2~0); 2091#L85-1 assume !(0 != main_~p3~0); 2166#L89-1 assume !(0 != main_~p4~0); 2167#L93-1 assume !(0 != main_~p5~0); 2172#L97-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2147#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2146#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2145#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2143#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2142#L117-1 assume !(0 != main_~p11~0); 2139#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2136#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2132#L129-1 assume !(0 != main_~p1~0); 2129#L135-1 assume !(0 != main_~p2~0); 2126#L140-1 assume !(0 != main_~p3~0); 2122#L145-1 assume !(0 != main_~p4~0); 2118#L150-1 assume !(0 != main_~p5~0); 2115#L155-1 assume !(0 != main_~p6~0); 2111#L160-1 assume !(0 != main_~p7~0); 2108#L165-1 assume !(0 != main_~p8~0); 2105#L170-1 assume !(0 != main_~p9~0); 2102#L175-1 assume !(0 != main_~p10~0); 2100#L180-1 assume !(0 != main_~p11~0); 2097#L185-1 assume !(0 != main_~p12~0); 2096#L190-1 assume !(0 != main_~p13~0); 1874#L195-1 [2019-11-20 10:12:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-20 10:12:16,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437648735] [2019-11-20 10:12:16,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,096 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1775813835, now seen corresponding path program 1 times [2019-11-20 10:12:16,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045757627] [2019-11-20 10:12:16,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:16,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045757627] [2019-11-20 10:12:16,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:16,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:16,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230331901] [2019-11-20 10:12:16,126 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:16,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:16,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:16,126 INFO L87 Difference]: Start difference. First operand 625 states and 977 transitions. cyclomatic complexity: 368 Second operand 3 states. [2019-11-20 10:12:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:16,159 INFO L93 Difference]: Finished difference Result 1233 states and 1905 transitions. [2019-11-20 10:12:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:16,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1233 states and 1905 transitions. [2019-11-20 10:12:16,176 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2019-11-20 10:12:16,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1233 states to 1233 states and 1905 transitions. [2019-11-20 10:12:16,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1233 [2019-11-20 10:12:16,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1233 [2019-11-20 10:12:16,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1233 states and 1905 transitions. [2019-11-20 10:12:16,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:16,192 INFO L688 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-11-20 10:12:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states and 1905 transitions. [2019-11-20 10:12:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2019-11-20 10:12:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-11-20 10:12:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1905 transitions. [2019-11-20 10:12:16,220 INFO L711 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-11-20 10:12:16,220 INFO L591 BuchiCegarLoop]: Abstraction has 1233 states and 1905 transitions. [2019-11-20 10:12:16,220 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 10:12:16,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1233 states and 1905 transitions. [2019-11-20 10:12:16,227 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2019-11-20 10:12:16,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:16,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:16,228 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:16,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:16,229 INFO L794 eck$LassoCheckResult]: Stem: 3742#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 3743#L195-1 [2019-11-20 10:12:16,229 INFO L796 eck$LassoCheckResult]: Loop: 3743#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 3984#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 3980#L81 assume !(0 != main_~p1~0); 3975#L81-2 assume !(0 != main_~p2~0); 3973#L85-1 assume !(0 != main_~p3~0); 3969#L89-1 assume !(0 != main_~p4~0); 3933#L93-1 assume !(0 != main_~p5~0); 3935#L97-1 assume !(0 != main_~p6~0); 3957#L101-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 3956#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 3955#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 3954#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 3953#L117-1 assume !(0 != main_~p11~0); 3952#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 3951#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 3949#L129-1 assume !(0 != main_~p1~0); 3950#L135-1 assume !(0 != main_~p2~0); 4027#L140-1 assume !(0 != main_~p3~0); 4023#L145-1 assume !(0 != main_~p4~0); 4021#L150-1 assume !(0 != main_~p5~0); 4017#L155-1 assume !(0 != main_~p6~0); 4014#L160-1 assume !(0 != main_~p7~0); 4010#L165-1 assume !(0 != main_~p8~0); 4006#L170-1 assume !(0 != main_~p9~0); 4002#L175-1 assume !(0 != main_~p10~0); 4000#L180-1 assume !(0 != main_~p11~0); 3994#L185-1 assume !(0 != main_~p12~0); 3990#L190-1 assume !(0 != main_~p13~0); 3743#L195-1 [2019-11-20 10:12:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-20 10:12:16,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394038596] [2019-11-20 10:12:16,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1353112009, now seen corresponding path program 1 times [2019-11-20 10:12:16,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221330009] [2019-11-20 10:12:16,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:16,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221330009] [2019-11-20 10:12:16,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:16,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:16,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558340479] [2019-11-20 10:12:16,264 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:16,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:16,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:16,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:16,265 INFO L87 Difference]: Start difference. First operand 1233 states and 1905 transitions. cyclomatic complexity: 704 Second operand 3 states. [2019-11-20 10:12:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:16,297 INFO L93 Difference]: Finished difference Result 2433 states and 3713 transitions. [2019-11-20 10:12:16,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:16,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2433 states and 3713 transitions. [2019-11-20 10:12:16,329 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2019-11-20 10:12:16,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2433 states to 2433 states and 3713 transitions. [2019-11-20 10:12:16,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2433 [2019-11-20 10:12:16,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2433 [2019-11-20 10:12:16,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2433 states and 3713 transitions. [2019-11-20 10:12:16,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:16,359 INFO L688 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-11-20 10:12:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states and 3713 transitions. [2019-11-20 10:12:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-11-20 10:12:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-11-20 10:12:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3713 transitions. [2019-11-20 10:12:16,419 INFO L711 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-11-20 10:12:16,419 INFO L591 BuchiCegarLoop]: Abstraction has 2433 states and 3713 transitions. [2019-11-20 10:12:16,419 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 10:12:16,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2433 states and 3713 transitions. [2019-11-20 10:12:16,435 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2019-11-20 10:12:16,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:16,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:16,437 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:16,437 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:16,437 INFO L794 eck$LassoCheckResult]: Stem: 7415#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 7416#L195-1 [2019-11-20 10:12:16,438 INFO L796 eck$LassoCheckResult]: Loop: 7416#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 8061#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 8059#L81 assume !(0 != main_~p1~0); 8057#L81-2 assume !(0 != main_~p2~0); 8056#L85-1 assume !(0 != main_~p3~0); 8052#L89-1 assume !(0 != main_~p4~0); 8048#L93-1 assume !(0 != main_~p5~0); 8046#L97-1 assume !(0 != main_~p6~0); 7726#L101-1 assume !(0 != main_~p7~0); 7727#L105-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8041#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8040#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8039#L117-1 assume !(0 != main_~p11~0); 8038#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8037#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8036#L129-1 assume !(0 != main_~p1~0); 7915#L135-1 assume !(0 != main_~p2~0); 7817#L140-1 assume !(0 != main_~p3~0); 7816#L145-1 assume !(0 != main_~p4~0); 7912#L150-1 assume !(0 != main_~p5~0); 7910#L155-1 assume !(0 != main_~p6~0); 7911#L160-1 assume !(0 != main_~p7~0); 8227#L165-1 assume !(0 != main_~p8~0); 8223#L170-1 assume !(0 != main_~p9~0); 8219#L175-1 assume !(0 != main_~p10~0); 8215#L180-1 assume !(0 != main_~p11~0); 8210#L185-1 assume !(0 != main_~p12~0); 8208#L190-1 assume !(0 != main_~p13~0); 7416#L195-1 [2019-11-20 10:12:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,438 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-20 10:12:16,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363593434] [2019-11-20 10:12:16,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,462 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2124206837, now seen corresponding path program 1 times [2019-11-20 10:12:16,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616668882] [2019-11-20 10:12:16,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:16,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616668882] [2019-11-20 10:12:16,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:16,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:16,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121761576] [2019-11-20 10:12:16,510 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:16,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:16,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:16,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:16,511 INFO L87 Difference]: Start difference. First operand 2433 states and 3713 transitions. cyclomatic complexity: 1344 Second operand 3 states. [2019-11-20 10:12:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:16,556 INFO L93 Difference]: Finished difference Result 4801 states and 7233 transitions. [2019-11-20 10:12:16,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:16,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4801 states and 7233 transitions. [2019-11-20 10:12:16,599 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2019-11-20 10:12:16,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4801 states to 4801 states and 7233 transitions. [2019-11-20 10:12:16,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4801 [2019-11-20 10:12:16,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4801 [2019-11-20 10:12:16,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4801 states and 7233 transitions. [2019-11-20 10:12:16,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:16,655 INFO L688 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-11-20 10:12:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states and 7233 transitions. [2019-11-20 10:12:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 4801. [2019-11-20 10:12:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-11-20 10:12:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 7233 transitions. [2019-11-20 10:12:16,787 INFO L711 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-11-20 10:12:16,787 INFO L591 BuchiCegarLoop]: Abstraction has 4801 states and 7233 transitions. [2019-11-20 10:12:16,787 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 10:12:16,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4801 states and 7233 transitions. [2019-11-20 10:12:16,817 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2019-11-20 10:12:16,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:16,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:16,819 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:16,819 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:16,820 INFO L794 eck$LassoCheckResult]: Stem: 14653#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 14654#L195-1 [2019-11-20 10:12:16,827 INFO L796 eck$LassoCheckResult]: Loop: 14654#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 14943#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 14940#L81 assume !(0 != main_~p1~0); 14936#L81-2 assume !(0 != main_~p2~0); 14933#L85-1 assume !(0 != main_~p3~0); 14930#L89-1 assume !(0 != main_~p4~0); 14931#L93-1 assume !(0 != main_~p5~0); 14868#L97-1 assume !(0 != main_~p6~0); 14869#L101-1 assume !(0 != main_~p7~0); 14851#L105-1 assume !(0 != main_~p8~0); 14853#L109-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 14836#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 14837#L117-1 assume !(0 != main_~p11~0); 14822#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 14823#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 14804#L129-1 assume !(0 != main_~p1~0); 14806#L135-1 assume !(0 != main_~p2~0); 14787#L140-1 assume !(0 != main_~p3~0); 14786#L145-1 assume !(0 != main_~p4~0); 14973#L150-1 assume !(0 != main_~p5~0); 14970#L155-1 assume !(0 != main_~p6~0); 14968#L160-1 assume !(0 != main_~p7~0); 14966#L165-1 assume !(0 != main_~p8~0); 14964#L170-1 assume !(0 != main_~p9~0); 14960#L175-1 assume !(0 != main_~p10~0); 14956#L180-1 assume !(0 != main_~p11~0); 14951#L185-1 assume !(0 != main_~p12~0); 14948#L190-1 assume !(0 != main_~p13~0); 14654#L195-1 [2019-11-20 10:12:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-20 10:12:16,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590512889] [2019-11-20 10:12:16,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:16,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash 435263095, now seen corresponding path program 1 times [2019-11-20 10:12:16,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:16,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304814344] [2019-11-20 10:12:16,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:16,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304814344] [2019-11-20 10:12:16,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:16,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:16,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016163257] [2019-11-20 10:12:16,896 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:16,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:16,897 INFO L87 Difference]: Start difference. First operand 4801 states and 7233 transitions. cyclomatic complexity: 2560 Second operand 3 states. [2019-11-20 10:12:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:16,966 INFO L93 Difference]: Finished difference Result 9473 states and 14081 transitions. [2019-11-20 10:12:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:16,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9473 states and 14081 transitions. [2019-11-20 10:12:17,038 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2019-11-20 10:12:17,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9473 states to 9473 states and 14081 transitions. [2019-11-20 10:12:17,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9473 [2019-11-20 10:12:17,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9473 [2019-11-20 10:12:17,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9473 states and 14081 transitions. [2019-11-20 10:12:17,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:17,193 INFO L688 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-11-20 10:12:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states and 14081 transitions. [2019-11-20 10:12:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 9473. [2019-11-20 10:12:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2019-11-20 10:12:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 14081 transitions. [2019-11-20 10:12:17,388 INFO L711 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-11-20 10:12:17,388 INFO L591 BuchiCegarLoop]: Abstraction has 9473 states and 14081 transitions. [2019-11-20 10:12:17,388 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 10:12:17,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9473 states and 14081 transitions. [2019-11-20 10:12:17,423 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2019-11-20 10:12:17,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:17,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:17,425 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:17,425 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:17,426 INFO L794 eck$LassoCheckResult]: Stem: 28929#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 28930#L195-1 [2019-11-20 10:12:17,426 INFO L796 eck$LassoCheckResult]: Loop: 28930#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 29188#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 29184#L81 assume !(0 != main_~p1~0); 29181#L81-2 assume !(0 != main_~p2~0); 29129#L85-1 assume !(0 != main_~p3~0); 29122#L89-1 assume !(0 != main_~p4~0); 29120#L93-1 assume !(0 != main_~p5~0); 29118#L97-1 assume !(0 != main_~p6~0); 29115#L101-1 assume !(0 != main_~p7~0); 29111#L105-1 assume !(0 != main_~p8~0); 29107#L109-1 assume !(0 != main_~p9~0); 29108#L113-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 29245#L117-1 assume !(0 != main_~p11~0); 29244#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 29243#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 29241#L129-1 assume !(0 != main_~p1~0); 29239#L135-1 assume !(0 != main_~p2~0); 29238#L140-1 assume !(0 != main_~p3~0); 29235#L145-1 assume !(0 != main_~p4~0); 29233#L150-1 assume !(0 != main_~p5~0); 29232#L155-1 assume !(0 != main_~p6~0); 29230#L160-1 assume !(0 != main_~p7~0); 29228#L165-1 assume !(0 != main_~p8~0); 29229#L170-1 assume !(0 != main_~p9~0); 29267#L175-1 assume !(0 != main_~p10~0); 29265#L180-1 assume !(0 != main_~p11~0); 29256#L185-1 assume !(0 != main_~p12~0); 29193#L190-1 assume !(0 != main_~p13~0); 28930#L195-1 [2019-11-20 10:12:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-20 10:12:17,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:17,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595315489] [2019-11-20 10:12:17,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:17,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:17,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1558881611, now seen corresponding path program 1 times [2019-11-20 10:12:17,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:17,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230902748] [2019-11-20 10:12:17,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:17,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230902748] [2019-11-20 10:12:17,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:17,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:17,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910414493] [2019-11-20 10:12:17,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:17,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:17,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:17,490 INFO L87 Difference]: Start difference. First operand 9473 states and 14081 transitions. cyclomatic complexity: 4864 Second operand 3 states. [2019-11-20 10:12:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:17,553 INFO L93 Difference]: Finished difference Result 18689 states and 27393 transitions. [2019-11-20 10:12:17,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:17,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18689 states and 27393 transitions. [2019-11-20 10:12:17,651 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2019-11-20 10:12:17,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18689 states to 18689 states and 27393 transitions. [2019-11-20 10:12:17,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18689 [2019-11-20 10:12:17,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18689 [2019-11-20 10:12:17,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18689 states and 27393 transitions. [2019-11-20 10:12:17,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:17,780 INFO L688 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-11-20 10:12:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18689 states and 27393 transitions. [2019-11-20 10:12:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18689 to 18689. [2019-11-20 10:12:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18689 states. [2019-11-20 10:12:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18689 states to 18689 states and 27393 transitions. [2019-11-20 10:12:18,114 INFO L711 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-11-20 10:12:18,114 INFO L591 BuchiCegarLoop]: Abstraction has 18689 states and 27393 transitions. [2019-11-20 10:12:18,115 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 10:12:18,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18689 states and 27393 transitions. [2019-11-20 10:12:18,268 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2019-11-20 10:12:18,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:18,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:18,270 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:18,270 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:18,270 INFO L794 eck$LassoCheckResult]: Stem: 57102#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 57103#L195-1 [2019-11-20 10:12:18,271 INFO L796 eck$LassoCheckResult]: Loop: 57103#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 57672#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 57668#L81 assume !(0 != main_~p1~0); 57664#L81-2 assume !(0 != main_~p2~0); 57662#L85-1 assume !(0 != main_~p3~0); 57660#L89-1 assume !(0 != main_~p4~0); 57655#L93-1 assume !(0 != main_~p5~0); 57651#L97-1 assume !(0 != main_~p6~0); 57644#L101-1 assume !(0 != main_~p7~0); 57636#L105-1 assume !(0 != main_~p8~0); 57629#L109-1 assume !(0 != main_~p9~0); 57624#L113-1 assume !(0 != main_~p10~0); 57625#L117-1 assume !(0 != main_~p11~0); 57621#L121-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 57617#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 57612#L129-1 assume !(0 != main_~p1~0); 57606#L135-1 assume !(0 != main_~p2~0); 57586#L140-1 assume !(0 != main_~p3~0); 57585#L145-1 assume !(0 != main_~p4~0); 57587#L150-1 assume !(0 != main_~p5~0); 57588#L155-1 assume !(0 != main_~p6~0); 57540#L160-1 assume !(0 != main_~p7~0); 57542#L165-1 assume !(0 != main_~p8~0); 57492#L170-1 assume !(0 != main_~p9~0); 57494#L175-1 assume !(0 != main_~p10~0); 57684#L180-1 assume !(0 != main_~p11~0); 57679#L185-1 assume !(0 != main_~p12~0); 57676#L190-1 assume !(0 != main_~p13~0); 57103#L195-1 [2019-11-20 10:12:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-20 10:12:18,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:18,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975563816] [2019-11-20 10:12:18,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:18,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1147737783, now seen corresponding path program 1 times [2019-11-20 10:12:18,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:18,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907412365] [2019-11-20 10:12:18,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:18,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907412365] [2019-11-20 10:12:18,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:18,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:12:18,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412343314] [2019-11-20 10:12:18,327 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:18,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:18,328 INFO L87 Difference]: Start difference. First operand 18689 states and 27393 transitions. cyclomatic complexity: 9216 Second operand 3 states. [2019-11-20 10:12:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:18,438 INFO L93 Difference]: Finished difference Result 36865 states and 53249 transitions. [2019-11-20 10:12:18,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:18,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36865 states and 53249 transitions. [2019-11-20 10:12:18,604 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2019-11-20 10:12:18,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36865 states to 36865 states and 53249 transitions. [2019-11-20 10:12:18,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36865 [2019-11-20 10:12:18,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36865 [2019-11-20 10:12:18,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36865 states and 53249 transitions. [2019-11-20 10:12:18,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:18,789 INFO L688 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-11-20 10:12:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36865 states and 53249 transitions. [2019-11-20 10:12:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36865 to 36865. [2019-11-20 10:12:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36865 states. [2019-11-20 10:12:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36865 states to 36865 states and 53249 transitions. [2019-11-20 10:12:19,712 INFO L711 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-11-20 10:12:19,712 INFO L591 BuchiCegarLoop]: Abstraction has 36865 states and 53249 transitions. [2019-11-20 10:12:19,712 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 10:12:19,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36865 states and 53249 transitions. [2019-11-20 10:12:19,827 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2019-11-20 10:12:19,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:19,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:19,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:19,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:19,829 INFO L794 eck$LassoCheckResult]: Stem: 112667#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 112668#L195-1 [2019-11-20 10:12:19,829 INFO L796 eck$LassoCheckResult]: Loop: 112668#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 113249#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 113250#L81 assume !(0 != main_~p1~0); 113230#L81-2 assume !(0 != main_~p2~0); 113220#L85-1 assume !(0 != main_~p3~0); 113221#L89-1 assume !(0 != main_~p4~0); 113327#L93-1 assume !(0 != main_~p5~0); 113326#L97-1 assume !(0 != main_~p6~0); 113323#L101-1 assume !(0 != main_~p7~0); 113312#L105-1 assume !(0 != main_~p8~0); 113310#L109-1 assume !(0 != main_~p9~0); 113307#L113-1 assume !(0 != main_~p10~0); 113304#L117-1 assume !(0 != main_~p11~0); 113302#L121-1 assume !(0 != main_~p12~0); 113292#L125-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 113041#L129-1 assume !(0 != main_~p1~0); 113043#L135-1 assume !(0 != main_~p2~0); 113026#L140-1 assume !(0 != main_~p3~0); 113025#L145-1 assume !(0 != main_~p4~0); 113007#L150-1 assume !(0 != main_~p5~0); 113008#L155-1 assume !(0 != main_~p6~0); 112991#L160-1 assume !(0 != main_~p7~0); 112993#L165-1 assume !(0 != main_~p8~0); 112985#L170-1 assume !(0 != main_~p9~0); 112987#L175-1 assume !(0 != main_~p10~0); 112886#L180-1 assume !(0 != main_~p11~0); 112885#L185-1 assume !(0 != main_~p12~0); 113266#L190-1 assume !(0 != main_~p13~0); 112668#L195-1 [2019-11-20 10:12:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-11-20 10:12:19,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:19,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567019071] [2019-11-20 10:12:19,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:19,844 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:19,844 INFO L82 PathProgramCache]: Analyzing trace with hash -132125895, now seen corresponding path program 1 times [2019-11-20 10:12:19,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:19,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264490495] [2019-11-20 10:12:19,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:12:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:12:19,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264490495] [2019-11-20 10:12:19,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:12:19,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:12:19,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369368313] [2019-11-20 10:12:19,878 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 10:12:19,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:12:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:12:19,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:12:19,878 INFO L87 Difference]: Start difference. First operand 36865 states and 53249 transitions. cyclomatic complexity: 17408 Second operand 3 states. [2019-11-20 10:12:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:12:20,071 INFO L93 Difference]: Finished difference Result 72705 states and 103425 transitions. [2019-11-20 10:12:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:12:20,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72705 states and 103425 transitions. [2019-11-20 10:12:20,393 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2019-11-20 10:12:20,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72705 states to 72705 states and 103425 transitions. [2019-11-20 10:12:20,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72705 [2019-11-20 10:12:20,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72705 [2019-11-20 10:12:20,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72705 states and 103425 transitions. [2019-11-20 10:12:21,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:12:21,156 INFO L688 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-11-20 10:12:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72705 states and 103425 transitions. [2019-11-20 10:12:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72705 to 72705. [2019-11-20 10:12:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72705 states. [2019-11-20 10:12:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72705 states to 72705 states and 103425 transitions. [2019-11-20 10:12:21,862 INFO L711 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-11-20 10:12:21,862 INFO L591 BuchiCegarLoop]: Abstraction has 72705 states and 103425 transitions. [2019-11-20 10:12:21,862 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 10:12:21,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72705 states and 103425 transitions. [2019-11-20 10:12:22,053 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2019-11-20 10:12:22,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:12:22,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:12:22,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-20 10:12:22,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:12:22,055 INFO L794 eck$LassoCheckResult]: Stem: 222242#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_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, 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_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~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;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk13~0;havoc main_~cond~0; 222243#L195-1 [2019-11-20 10:12:22,055 INFO L796 eck$LassoCheckResult]: Loop: 222243#L195-1 assume !false;main_~cond~0 := main_#t~nondet13;havoc main_#t~nondet13; 222479#L50 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;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0; 222476#L81 assume !(0 != main_~p1~0); 222477#L81-2 assume !(0 != main_~p2~0); 222455#L85-1 assume !(0 != main_~p3~0); 222456#L89-1 assume !(0 != main_~p4~0); 222439#L93-1 assume !(0 != main_~p5~0); 222441#L97-1 assume !(0 != main_~p6~0); 222415#L101-1 assume !(0 != main_~p7~0); 222417#L105-1 assume !(0 != main_~p8~0); 222391#L109-1 assume !(0 != main_~p9~0); 222393#L113-1 assume !(0 != main_~p10~0); 222371#L117-1 assume !(0 != main_~p11~0); 222372#L121-1 assume !(0 != main_~p12~0); 222347#L125-1 assume !(0 != main_~p13~0); 222349#L129-1 assume !(0 != main_~p1~0); 222518#L135-1 assume !(0 != main_~p2~0); 222517#L140-1 assume !(0 != main_~p3~0); 222514#L145-1 assume !(0 != main_~p4~0); 222512#L150-1 assume !(0 != main_~p5~0); 222510#L155-1 assume !(0 != main_~p6~0); 222507#L160-1 assume !(0 != main_~p7~0); 222503#L165-1 assume !(0 != main_~p8~0); 222499#L170-1 assume !(0 != main_~p9~0); 222495#L175-1 assume !(0 != main_~p10~0); 222492#L180-1 assume !(0 != main_~p11~0); 222487#L185-1 assume !(0 != main_~p12~0); 222483#L190-1 assume !(0 != main_~p13~0); 222243#L195-1 [2019-11-20 10:12:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-11-20 10:12:22,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:22,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408189977] [2019-11-20 10:12:22,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:22,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1143243145, now seen corresponding path program 1 times [2019-11-20 10:12:22,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:22,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226700045] [2019-11-20 10:12:22,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:22,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:12:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1131927018, now seen corresponding path program 1 times [2019-11-20 10:12:22,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:12:22,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706814105] [2019-11-20 10:12:22,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:12:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:12:22,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:12:22,224 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 10:12:22,332 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 10:12:22,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:12:22 BoogieIcfgContainer [2019-11-20 10:12:22,431 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 10:12:22,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:12:22,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:12:22,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:12:22,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:12:15" (3/4) ... [2019-11-20 10:12:22,436 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-20 10:12:22,508 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6b77e6ee-3c9e-4e0f-a572-98b44951f397/bin/uautomizer/witness.graphml [2019-11-20 10:12:22,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:12:22,510 INFO L168 Benchmark]: Toolchain (without parser) took 8239.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.0 MB). Free memory was 946.1 MB in the beginning and 701.5 MB in the end (delta: 244.6 MB). Peak memory consumption was 741.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:12:22,510 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:12:22,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:12:22,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:12:22,512 INFO L168 Benchmark]: Boogie Preprocessor took 24.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:12:22,512 INFO L168 Benchmark]: RCFGBuilder took 397.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:12:22,513 INFO L168 Benchmark]: BuchiAutomizer took 7282.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 360.2 MB). Free memory was 1.1 GB in the beginning and 705.0 MB in the end (delta: 399.0 MB). Peak memory consumption was 759.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:12:22,514 INFO L168 Benchmark]: Witness Printer took 76.92 ms. Allocated memory is still 1.5 GB. Free memory was 705.0 MB in the beginning and 701.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:12:22,516 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 397.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7282.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 360.2 MB). Free memory was 1.1 GB in the beginning and 705.0 MB in the end (delta: 399.0 MB). Peak memory consumption was 759.2 MB. Max. memory is 11.5 GB. * Witness Printer took 76.92 ms. Allocated memory is still 1.5 GB. Free memory was 705.0 MB in the beginning and 701.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72705 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.1s. Biggest automaton had 72705 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1122 SDtfs, 589 SDslu, 698 SDs, 0 SdLazy, 55 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI11 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: 48]: 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, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@535e4115=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d777b6e=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a8e4e2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8b0db23=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@350d6f47=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8a716c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69ffc221=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29d0a820=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5db9e042=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dea0d47=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78849542=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46de4591=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f4a0a7f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@775de0ab=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L46] int cond; Loop: [L48] COND TRUE 1 [L49] cond = __VERIFIER_nondet_int() [L50] COND FALSE !(cond == 0) [L53] lk1 = 0 [L55] lk2 = 0 [L57] lk3 = 0 [L59] lk4 = 0 [L61] lk5 = 0 [L63] lk6 = 0 [L65] lk7 = 0 [L67] lk8 = 0 [L69] lk9 = 0 [L71] lk10 = 0 [L73] lk11 = 0 [L75] lk12 = 0 [L77] lk13 = 0 [L81] COND FALSE !(p1 != 0) [L85] COND FALSE !(p2 != 0) [L89] COND FALSE !(p3 != 0) [L93] COND FALSE !(p4 != 0) [L97] COND FALSE !(p5 != 0) [L101] COND FALSE !(p6 != 0) [L105] COND FALSE !(p7 != 0) [L109] COND FALSE !(p8 != 0) [L113] COND FALSE !(p9 != 0) [L117] COND FALSE !(p10 != 0) [L121] COND FALSE !(p11 != 0) [L125] COND FALSE !(p12 != 0) [L129] COND FALSE !(p13 != 0) [L135] COND FALSE !(p1 != 0) [L140] COND FALSE !(p2 != 0) [L145] COND FALSE !(p3 != 0) [L150] COND FALSE !(p4 != 0) [L155] COND FALSE !(p5 != 0) [L160] COND FALSE !(p6 != 0) [L165] COND FALSE !(p7 != 0) [L170] COND FALSE !(p8 != 0) [L175] COND FALSE !(p9 != 0) [L180] COND FALSE !(p10 != 0) [L185] COND FALSE !(p11 != 0) [L190] COND FALSE !(p12 != 0) [L195] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...