./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/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 4892275a211cad54ffe3d940980c258aec58e47d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-25 08:56:33,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:33,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:33,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:33,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:33,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:33,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:33,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:33,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:33,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:33,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:33,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:33,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:33,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:33,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:33,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:33,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:33,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:33,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:33,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:33,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:33,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:33,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:33,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:33,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:33,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:33,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:33,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:33,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:33,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:33,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:33,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:33,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:33,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:33,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:33,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:33,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:33,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:33,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:33,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:33,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:33,706 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:56:33,726 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:33,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:33,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:33,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:33,728 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:33,729 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:56:33,729 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:56:33,729 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:56:33,729 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:56:33,730 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:56:33,731 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:56:33,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:33,731 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:33,731 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:56:33,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:33,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:33,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:33,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:56:33,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:56:33,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:56:33,733 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:33,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:33,733 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:56:33,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:33,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:56:33,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:33,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:33,734 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:56:33,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:33,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:56:33,735 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:56:33,736 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:56:33,736 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_012aac8b-1aa6-40c3-a794-d65d60fe50b3/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 -> 4892275a211cad54ffe3d940980c258aec58e47d [2019-11-25 08:56:33,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:33,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:33,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:33,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:33,946 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:33,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_15-1.c [2019-11-25 08:56:34,017 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/data/3a028be64/0f5972eabc1b4760a4c4cd09887bdca4/FLAG73868f9a9 [2019-11-25 08:56:34,490 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:34,491 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/sv-benchmarks/c/locks/test_locks_15-1.c [2019-11-25 08:56:34,499 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/data/3a028be64/0f5972eabc1b4760a4c4cd09887bdca4/FLAG73868f9a9 [2019-11-25 08:56:34,898 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/data/3a028be64/0f5972eabc1b4760a4c4cd09887bdca4 [2019-11-25 08:56:34,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:34,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:34,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:34,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:34,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:34,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:34" (1/1) ... [2019-11-25 08:56:34,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2591e8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:34, skipping insertion in model container [2019-11-25 08:56:34,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:34" (1/1) ... [2019-11-25 08:56:34,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:34,962 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:35,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:35,195 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:35,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:35,237 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:35,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35 WrapperNode [2019-11-25 08:56:35,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:35,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:35,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:35,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:35,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:35,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:35,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:35,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:35,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... [2019-11-25 08:56:35,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:35,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:35,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:35,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:35,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/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-25 08:56:35,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:35,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:35,751 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:35,751 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 08:56:35,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:35 BoogieIcfgContainer [2019-11-25 08:56:35,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:35,753 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:56:35,753 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:56:35,756 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:56:35,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:56:35,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:56:34" (1/3) ... [2019-11-25 08:56:35,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@413067e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:56:35, skipping insertion in model container [2019-11-25 08:56:35,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:56:35,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:35" (2/3) ... [2019-11-25 08:56:35,761 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@413067e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:56:35, skipping insertion in model container [2019-11-25 08:56:35,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:56:35,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:35" (3/3) ... [2019-11-25 08:56:35,772 INFO L371 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2019-11-25 08:56:35,838 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:56:35,838 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:56:35,838 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:56:35,841 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:35,841 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:35,841 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:56:35,841 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:35,841 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:56:35,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-11-25 08:56:35,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-25 08:56:35,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:35,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:35,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:35,898 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:35,898 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:56:35,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2019-11-25 08:56:35,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2019-11-25 08:56:35,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:35,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:35,911 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:35,911 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:35,920 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 9#L223-1true [2019-11-25 08:56:35,922 INFO L796 eck$LassoCheckResult]: Loop: 9#L223-1true assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 41#L56true 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 4#L91true assume 0 != main_~p1~0;main_~lk1~0 := 1; 17#L91-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 10#L95-1true assume !(0 != main_~p3~0); 30#L99-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 21#L103-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 38#L107-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 43#L111-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 35#L115-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 52#L119-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 44#L123-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 49#L127-1true assume !(0 != main_~p11~0); 14#L131-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 6#L135-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 27#L139-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 32#L143-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 23#L147-1true assume !(0 != main_~p1~0); 15#L153-1true assume 0 != main_~p2~0; 50#L159true assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 24#L158true assume !(0 != main_~p3~0); 54#L163-1true assume !(0 != main_~p4~0); 7#L168-1true assume !(0 != main_~p5~0); 40#L173-1true assume !(0 != main_~p6~0); 47#L178-1true assume !(0 != main_~p7~0); 29#L183-1true assume !(0 != main_~p8~0); 33#L188-1true assume !(0 != main_~p9~0); 11#L193-1true assume !(0 != main_~p10~0); 20#L198-1true assume !(0 != main_~p11~0); 51#L203-1true assume !(0 != main_~p12~0); 3#L208-1true assume !(0 != main_~p13~0); 26#L213-1true assume 0 != main_~p14~0; 5#L219true assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 45#L218true assume !(0 != main_~p15~0); 9#L223-1true [2019-11-25 08:56:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:35,928 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-25 08:56:35,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:35,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455839466] [2019-11-25 08:56:35,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash 878446630, now seen corresponding path program 1 times [2019-11-25 08:56:36,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676434537] [2019-11-25 08:56:36,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:36,251 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-25 08:56:36,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676434537] [2019-11-25 08:56:36,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:36,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:36,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624680953] [2019-11-25 08:56:36,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:36,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:36,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:36,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:36,277 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-11-25 08:56:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:36,326 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2019-11-25 08:56:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:36,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 189 transitions. [2019-11-25 08:56:36,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-25 08:56:36,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 94 states and 148 transitions. [2019-11-25 08:56:36,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-25 08:56:36,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-11-25 08:56:36,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 148 transitions. [2019-11-25 08:56:36,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:36,348 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-11-25 08:56:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 148 transitions. [2019-11-25 08:56:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-25 08:56:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 08:56:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2019-11-25 08:56:36,392 INFO L711 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-11-25 08:56:36,393 INFO L591 BuchiCegarLoop]: Abstraction has 94 states and 148 transitions. [2019-11-25 08:56:36,393 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:56:36,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 148 transitions. [2019-11-25 08:56:36,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2019-11-25 08:56:36,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:36,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:36,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:36,399 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:36,399 INFO L794 eck$LassoCheckResult]: Stem: 219#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 220#L223-1 [2019-11-25 08:56:36,399 INFO L796 eck$LassoCheckResult]: Loop: 220#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 200#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 201#L91 assume !(0 != main_~p1~0); 204#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 189#L95-1 assume !(0 != main_~p3~0); 190#L99-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 240#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 237#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 234#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 232#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 230#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 229#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 228#L127-1 assume !(0 != main_~p11~0); 226#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 176#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 177#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 218#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 223#L147-1 assume !(0 != main_~p1~0); 224#L153-1 assume 0 != main_~p2~0; 259#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 258#L158 assume !(0 != main_~p3~0); 256#L163-1 assume !(0 != main_~p4~0); 254#L168-1 assume !(0 != main_~p5~0); 252#L173-1 assume !(0 != main_~p6~0); 250#L178-1 assume !(0 != main_~p7~0); 247#L183-1 assume !(0 != main_~p8~0); 246#L188-1 assume !(0 != main_~p9~0); 244#L193-1 assume !(0 != main_~p10~0); 211#L198-1 assume !(0 != main_~p11~0); 195#L203-1 assume !(0 != main_~p12~0); 166#L208-1 assume !(0 != main_~p13~0); 168#L213-1 assume 0 != main_~p14~0; 172#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 173#L218 assume !(0 != main_~p15~0); 220#L223-1 [2019-11-25 08:56:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,400 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-25 08:56:36,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556982181] [2019-11-25 08:56:36,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1153206244, now seen corresponding path program 1 times [2019-11-25 08:56:36,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819287483] [2019-11-25 08:56:36,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:36,467 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-25 08:56:36,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819287483] [2019-11-25 08:56:36,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:36,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:36,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092187189] [2019-11-25 08:56:36,469 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:36,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:36,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:36,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:36,470 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-11-25 08:56:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:36,519 INFO L93 Difference]: Finished difference Result 185 states and 289 transitions. [2019-11-25 08:56:36,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:36,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 289 transitions. [2019-11-25 08:56:36,526 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-11-25 08:56:36,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 185 states and 289 transitions. [2019-11-25 08:56:36,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2019-11-25 08:56:36,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2019-11-25 08:56:36,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 289 transitions. [2019-11-25 08:56:36,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:36,541 INFO L688 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-25 08:56:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 289 transitions. [2019-11-25 08:56:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-25 08:56:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-25 08:56:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-11-25 08:56:36,562 INFO L711 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-25 08:56:36,562 INFO L591 BuchiCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-25 08:56:36,562 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:56:36,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 289 transitions. [2019-11-25 08:56:36,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2019-11-25 08:56:36,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:36,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:36,567 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:36,567 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:36,567 INFO L794 eck$LassoCheckResult]: Stem: 503#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 504#L223-1 [2019-11-25 08:56:36,567 INFO L796 eck$LassoCheckResult]: Loop: 504#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 584#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 583#L91 assume !(0 != main_~p1~0); 487#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 474#L95-1 assume !(0 != main_~p3~0); 475#L99-1 assume !(0 != main_~p4~0); 581#L103-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 621#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 620#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 619#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 618#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 617#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 616#L127-1 assume !(0 != main_~p11~0); 615#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 614#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 613#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 612#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 610#L147-1 assume !(0 != main_~p1~0); 609#L153-1 assume 0 != main_~p2~0; 608#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 607#L158 assume !(0 != main_~p3~0); 605#L163-1 assume !(0 != main_~p4~0); 604#L168-1 assume !(0 != main_~p5~0); 602#L173-1 assume !(0 != main_~p6~0); 600#L178-1 assume !(0 != main_~p7~0); 505#L183-1 assume !(0 != main_~p8~0); 456#L188-1 assume !(0 != main_~p9~0); 458#L193-1 assume !(0 != main_~p10~0); 593#L198-1 assume !(0 != main_~p11~0); 592#L203-1 assume !(0 != main_~p12~0); 590#L208-1 assume !(0 != main_~p13~0); 588#L213-1 assume 0 != main_~p14~0; 587#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 586#L218 assume !(0 != main_~p15~0); 504#L223-1 [2019-11-25 08:56:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-25 08:56:36,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085800228] [2019-11-25 08:56:36,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,582 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1755557658, now seen corresponding path program 1 times [2019-11-25 08:56:36,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320361918] [2019-11-25 08:56:36,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:36,626 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-25 08:56:36,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320361918] [2019-11-25 08:56:36,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:36,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:36,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243139963] [2019-11-25 08:56:36,627 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:36,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:36,628 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. cyclomatic complexity: 108 Second operand 3 states. [2019-11-25 08:56:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:36,656 INFO L93 Difference]: Finished difference Result 365 states and 565 transitions. [2019-11-25 08:56:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:36,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 565 transitions. [2019-11-25 08:56:36,661 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-11-25 08:56:36,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 365 states and 565 transitions. [2019-11-25 08:56:36,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2019-11-25 08:56:36,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2019-11-25 08:56:36,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 565 transitions. [2019-11-25 08:56:36,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:36,668 INFO L688 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-11-25 08:56:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 565 transitions. [2019-11-25 08:56:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2019-11-25 08:56:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-25 08:56:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 565 transitions. [2019-11-25 08:56:36,691 INFO L711 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-11-25 08:56:36,691 INFO L591 BuchiCegarLoop]: Abstraction has 365 states and 565 transitions. [2019-11-25 08:56:36,691 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:56:36,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 565 transitions. [2019-11-25 08:56:36,694 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2019-11-25 08:56:36,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:36,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:36,695 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:36,695 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:36,695 INFO L794 eck$LassoCheckResult]: Stem: 1062#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 1063#L223-1 [2019-11-25 08:56:36,695 INFO L796 eck$LassoCheckResult]: Loop: 1063#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 1217#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 1215#L91 assume !(0 != main_~p1~0); 1213#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 1211#L95-1 assume !(0 != main_~p3~0); 1209#L99-1 assume !(0 != main_~p4~0); 1202#L103-1 assume !(0 != main_~p5~0); 1204#L107-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1194#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1195#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1189#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1190#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1184#L127-1 assume !(0 != main_~p11~0); 1185#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1178#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1179#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1172#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1173#L147-1 assume !(0 != main_~p1~0); 1167#L153-1 assume 0 != main_~p2~0; 1168#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 1144#L158 assume !(0 != main_~p3~0); 1143#L163-1 assume !(0 != main_~p4~0); 1252#L168-1 assume !(0 != main_~p5~0); 1250#L173-1 assume !(0 != main_~p6~0); 1246#L178-1 assume !(0 != main_~p7~0); 1243#L183-1 assume !(0 != main_~p8~0); 1242#L188-1 assume !(0 != main_~p9~0); 1240#L193-1 assume !(0 != main_~p10~0); 1236#L198-1 assume !(0 != main_~p11~0); 1234#L203-1 assume !(0 != main_~p12~0); 1231#L208-1 assume !(0 != main_~p13~0); 1228#L213-1 assume 0 != main_~p14~0; 1227#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 1222#L218 assume !(0 != main_~p15~0); 1063#L223-1 [2019-11-25 08:56:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-25 08:56:36,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889550285] [2019-11-25 08:56:36,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2029936548, now seen corresponding path program 1 times [2019-11-25 08:56:36,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920818877] [2019-11-25 08:56:36,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:36,773 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-25 08:56:36,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920818877] [2019-11-25 08:56:36,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:36,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:36,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75570321] [2019-11-25 08:56:36,774 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:36,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:36,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:36,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:36,775 INFO L87 Difference]: Start difference. First operand 365 states and 565 transitions. cyclomatic complexity: 208 Second operand 3 states. [2019-11-25 08:56:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:36,793 INFO L93 Difference]: Finished difference Result 721 states and 1105 transitions. [2019-11-25 08:56:36,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:36,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1105 transitions. [2019-11-25 08:56:36,801 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-11-25 08:56:36,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 721 states and 1105 transitions. [2019-11-25 08:56:36,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 721 [2019-11-25 08:56:36,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 721 [2019-11-25 08:56:36,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 721 states and 1105 transitions. [2019-11-25 08:56:36,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:36,812 INFO L688 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-11-25 08:56:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states and 1105 transitions. [2019-11-25 08:56:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2019-11-25 08:56:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-25 08:56:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1105 transitions. [2019-11-25 08:56:36,844 INFO L711 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-11-25 08:56:36,844 INFO L591 BuchiCegarLoop]: Abstraction has 721 states and 1105 transitions. [2019-11-25 08:56:36,845 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:56:36,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 721 states and 1105 transitions. [2019-11-25 08:56:36,850 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2019-11-25 08:56:36,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:36,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:36,854 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:36,854 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:36,854 INFO L794 eck$LassoCheckResult]: Stem: 2156#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 2157#L223-1 [2019-11-25 08:56:36,855 INFO L796 eck$LassoCheckResult]: Loop: 2157#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 2233#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 2231#L91 assume !(0 != main_~p1~0); 2229#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 2227#L95-1 assume !(0 != main_~p3~0); 2223#L99-1 assume !(0 != main_~p4~0); 2219#L103-1 assume !(0 != main_~p5~0); 2215#L107-1 assume !(0 != main_~p6~0); 2213#L111-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2211#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2209#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2207#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2205#L127-1 assume !(0 != main_~p11~0); 2203#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2201#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2199#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2197#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2195#L147-1 assume !(0 != main_~p1~0); 2189#L153-1 assume 0 != main_~p2~0; 2190#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 2181#L158 assume !(0 != main_~p3~0); 2180#L163-1 assume !(0 != main_~p4~0); 2276#L168-1 assume !(0 != main_~p5~0); 2272#L173-1 assume !(0 != main_~p6~0); 2269#L178-1 assume !(0 != main_~p7~0); 2264#L183-1 assume !(0 != main_~p8~0); 2261#L188-1 assume !(0 != main_~p9~0); 2257#L193-1 assume !(0 != main_~p10~0); 2252#L198-1 assume !(0 != main_~p11~0); 2249#L203-1 assume !(0 != main_~p12~0); 2245#L208-1 assume !(0 != main_~p13~0); 2242#L213-1 assume 0 != main_~p14~0; 2240#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 2237#L218 assume !(0 != main_~p15~0); 2157#L223-1 [2019-11-25 08:56:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,856 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-25 08:56:36,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465933196] [2019-11-25 08:56:36,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:36,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,874 INFO L82 PathProgramCache]: Analyzing trace with hash -341802714, now seen corresponding path program 1 times [2019-11-25 08:56:36,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640026570] [2019-11-25 08:56:36,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:36,935 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-25 08:56:36,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640026570] [2019-11-25 08:56:36,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:36,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:36,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253066548] [2019-11-25 08:56:36,936 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:36,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:36,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:36,937 INFO L87 Difference]: Start difference. First operand 721 states and 1105 transitions. cyclomatic complexity: 400 Second operand 3 states. [2019-11-25 08:56:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:36,975 INFO L93 Difference]: Finished difference Result 1425 states and 2161 transitions. [2019-11-25 08:56:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:36,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1425 states and 2161 transitions. [2019-11-25 08:56:36,997 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-11-25 08:56:37,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1425 states to 1425 states and 2161 transitions. [2019-11-25 08:56:37,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1425 [2019-11-25 08:56:37,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1425 [2019-11-25 08:56:37,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1425 states and 2161 transitions. [2019-11-25 08:56:37,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:37,017 INFO L688 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-11-25 08:56:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states and 2161 transitions. [2019-11-25 08:56:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2019-11-25 08:56:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-11-25 08:56:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2161 transitions. [2019-11-25 08:56:37,053 INFO L711 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-11-25 08:56:37,053 INFO L591 BuchiCegarLoop]: Abstraction has 1425 states and 2161 transitions. [2019-11-25 08:56:37,053 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:56:37,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1425 states and 2161 transitions. [2019-11-25 08:56:37,064 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2019-11-25 08:56:37,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:37,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:37,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:37,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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:37,065 INFO L794 eck$LassoCheckResult]: Stem: 4308#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 4309#L223-1 [2019-11-25 08:56:37,066 INFO L796 eck$LassoCheckResult]: Loop: 4309#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 4386#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 4384#L91 assume !(0 != main_~p1~0); 4382#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 4380#L95-1 assume !(0 != main_~p3~0); 4376#L99-1 assume !(0 != main_~p4~0); 4372#L103-1 assume !(0 != main_~p5~0); 4368#L107-1 assume !(0 != main_~p6~0); 4364#L111-1 assume !(0 != main_~p7~0); 4362#L115-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4360#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4358#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4356#L127-1 assume !(0 != main_~p11~0); 4354#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4352#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4350#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4348#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4346#L147-1 assume !(0 != main_~p1~0); 4340#L153-1 assume 0 != main_~p2~0; 4341#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 4334#L158 assume !(0 != main_~p3~0); 4333#L163-1 assume !(0 != main_~p4~0); 4429#L168-1 assume !(0 != main_~p5~0); 4425#L173-1 assume !(0 != main_~p6~0); 4421#L178-1 assume !(0 != main_~p7~0); 4417#L183-1 assume !(0 != main_~p8~0); 4414#L188-1 assume !(0 != main_~p9~0); 4410#L193-1 assume !(0 != main_~p10~0); 4405#L198-1 assume !(0 != main_~p11~0); 4402#L203-1 assume !(0 != main_~p12~0); 4398#L208-1 assume !(0 != main_~p13~0); 4395#L213-1 assume 0 != main_~p14~0; 4393#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 4390#L218 assume !(0 != main_~p15~0); 4309#L223-1 [2019-11-25 08:56:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:37,066 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-25 08:56:37,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:37,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592221816] [2019-11-25 08:56:37,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:37,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash -279763100, now seen corresponding path program 1 times [2019-11-25 08:56:37,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:37,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693955761] [2019-11-25 08:56:37,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:37,151 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-25 08:56:37,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693955761] [2019-11-25 08:56:37,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:37,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:37,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056723781] [2019-11-25 08:56:37,152 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:37,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:37,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:37,153 INFO L87 Difference]: Start difference. First operand 1425 states and 2161 transitions. cyclomatic complexity: 768 Second operand 3 states. [2019-11-25 08:56:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:37,197 INFO L93 Difference]: Finished difference Result 2817 states and 4225 transitions. [2019-11-25 08:56:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:37,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2817 states and 4225 transitions. [2019-11-25 08:56:37,234 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-11-25 08:56:37,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2817 states to 2817 states and 4225 transitions. [2019-11-25 08:56:37,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2817 [2019-11-25 08:56:37,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2817 [2019-11-25 08:56:37,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2817 states and 4225 transitions. [2019-11-25 08:56:37,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:37,269 INFO L688 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-11-25 08:56:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states and 4225 transitions. [2019-11-25 08:56:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-11-25 08:56:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-11-25 08:56:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4225 transitions. [2019-11-25 08:56:37,343 INFO L711 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-11-25 08:56:37,343 INFO L591 BuchiCegarLoop]: Abstraction has 2817 states and 4225 transitions. [2019-11-25 08:56:37,343 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:56:37,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2817 states and 4225 transitions. [2019-11-25 08:56:37,367 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2019-11-25 08:56:37,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:37,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:37,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:37,371 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:37,371 INFO L794 eck$LassoCheckResult]: Stem: 8559#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 8560#L223-1 [2019-11-25 08:56:37,372 INFO L796 eck$LassoCheckResult]: Loop: 8560#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 8673#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 8669#L91 assume !(0 != main_~p1~0); 8665#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 8661#L95-1 assume !(0 != main_~p3~0); 8654#L99-1 assume !(0 != main_~p4~0); 8646#L103-1 assume !(0 != main_~p5~0); 8638#L107-1 assume !(0 != main_~p6~0); 8630#L111-1 assume !(0 != main_~p7~0); 8624#L115-1 assume !(0 != main_~p8~0); 8619#L119-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8620#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8613#L127-1 assume !(0 != main_~p11~0); 8614#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8607#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8608#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8601#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8602#L147-1 assume !(0 != main_~p1~0); 8593#L153-1 assume 0 != main_~p2~0; 8594#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 8759#L158 assume !(0 != main_~p3~0); 8752#L163-1 assume !(0 != main_~p4~0); 8746#L168-1 assume !(0 != main_~p5~0); 8722#L173-1 assume !(0 != main_~p6~0); 8719#L178-1 assume !(0 != main_~p7~0); 8716#L183-1 assume !(0 != main_~p8~0); 8715#L188-1 assume !(0 != main_~p9~0); 8713#L193-1 assume !(0 != main_~p10~0); 8710#L198-1 assume !(0 != main_~p11~0); 8709#L203-1 assume !(0 != main_~p12~0); 8707#L208-1 assume !(0 != main_~p13~0); 8704#L213-1 assume 0 != main_~p14~0; 8701#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 8682#L218 assume !(0 != main_~p15~0); 8560#L223-1 [2019-11-25 08:56:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-25 08:56:37,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:37,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289766848] [2019-11-25 08:56:37,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:37,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash -139214490, now seen corresponding path program 1 times [2019-11-25 08:56:37,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:37,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594597815] [2019-11-25 08:56:37,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:37,444 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-25 08:56:37,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594597815] [2019-11-25 08:56:37,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:37,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:37,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447678201] [2019-11-25 08:56:37,446 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:37,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:37,446 INFO L87 Difference]: Start difference. First operand 2817 states and 4225 transitions. cyclomatic complexity: 1472 Second operand 3 states. [2019-11-25 08:56:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:37,490 INFO L93 Difference]: Finished difference Result 5569 states and 8257 transitions. [2019-11-25 08:56:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:37,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5569 states and 8257 transitions. [2019-11-25 08:56:37,532 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-11-25 08:56:37,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5569 states to 5569 states and 8257 transitions. [2019-11-25 08:56:37,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5569 [2019-11-25 08:56:37,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5569 [2019-11-25 08:56:37,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5569 states and 8257 transitions. [2019-11-25 08:56:37,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:37,590 INFO L688 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-11-25 08:56:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states and 8257 transitions. [2019-11-25 08:56:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5569. [2019-11-25 08:56:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2019-11-25 08:56:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8257 transitions. [2019-11-25 08:56:37,737 INFO L711 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-11-25 08:56:37,737 INFO L591 BuchiCegarLoop]: Abstraction has 5569 states and 8257 transitions. [2019-11-25 08:56:37,737 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:56:37,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5569 states and 8257 transitions. [2019-11-25 08:56:37,763 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2019-11-25 08:56:37,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:37,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:37,765 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:37,766 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:37,766 INFO L794 eck$LassoCheckResult]: Stem: 16945#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 16946#L223-1 [2019-11-25 08:56:37,774 INFO L796 eck$LassoCheckResult]: Loop: 16946#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 17472#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 17468#L91 assume !(0 != main_~p1~0); 17465#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 17461#L95-1 assume !(0 != main_~p3~0); 17457#L99-1 assume !(0 != main_~p4~0); 17449#L103-1 assume !(0 != main_~p5~0); 17441#L107-1 assume !(0 != main_~p6~0); 17433#L111-1 assume !(0 != main_~p7~0); 17425#L115-1 assume !(0 != main_~p8~0); 17421#L119-1 assume !(0 != main_~p9~0); 17417#L123-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17413#L127-1 assume !(0 != main_~p11~0); 17409#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17405#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17401#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17397#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17390#L147-1 assume !(0 != main_~p1~0); 17386#L153-1 assume 0 != main_~p2~0; 17383#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 17377#L158 assume !(0 != main_~p3~0); 17369#L163-1 assume !(0 != main_~p4~0); 17370#L168-1 assume !(0 != main_~p5~0); 17503#L173-1 assume !(0 != main_~p6~0); 17501#L178-1 assume !(0 != main_~p7~0); 17496#L183-1 assume !(0 != main_~p8~0); 17492#L188-1 assume !(0 != main_~p9~0); 17490#L193-1 assume !(0 != main_~p10~0); 17487#L198-1 assume !(0 != main_~p11~0); 17486#L203-1 assume !(0 != main_~p12~0); 17483#L208-1 assume !(0 != main_~p13~0); 17481#L213-1 assume 0 != main_~p14~0; 17480#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 17476#L218 assume !(0 != main_~p15~0); 16946#L223-1 [2019-11-25 08:56:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:37,774 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-25 08:56:37,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:37,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117801187] [2019-11-25 08:56:37,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:37,791 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -273227996, now seen corresponding path program 1 times [2019-11-25 08:56:37,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:37,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986710273] [2019-11-25 08:56:37,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:37,826 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-25 08:56:37,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986710273] [2019-11-25 08:56:37,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:37,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:37,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982728765] [2019-11-25 08:56:37,827 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:37,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:37,828 INFO L87 Difference]: Start difference. First operand 5569 states and 8257 transitions. cyclomatic complexity: 2816 Second operand 3 states. [2019-11-25 08:56:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:37,879 INFO L93 Difference]: Finished difference Result 11009 states and 16129 transitions. [2019-11-25 08:56:37,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:37,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11009 states and 16129 transitions. [2019-11-25 08:56:37,943 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-11-25 08:56:38,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11009 states to 11009 states and 16129 transitions. [2019-11-25 08:56:38,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11009 [2019-11-25 08:56:38,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11009 [2019-11-25 08:56:38,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11009 states and 16129 transitions. [2019-11-25 08:56:38,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:38,062 INFO L688 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-11-25 08:56:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states and 16129 transitions. [2019-11-25 08:56:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11009. [2019-11-25 08:56:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11009 states. [2019-11-25 08:56:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11009 states to 11009 states and 16129 transitions. [2019-11-25 08:56:38,431 INFO L711 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-11-25 08:56:38,431 INFO L591 BuchiCegarLoop]: Abstraction has 11009 states and 16129 transitions. [2019-11-25 08:56:38,431 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:56:38,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11009 states and 16129 transitions. [2019-11-25 08:56:38,472 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2019-11-25 08:56:38,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:38,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:38,473 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:38,473 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:38,473 INFO L794 eck$LassoCheckResult]: Stem: 33534#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 33535#L223-1 [2019-11-25 08:56:38,474 INFO L796 eck$LassoCheckResult]: Loop: 33535#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 33828#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 33824#L91 assume !(0 != main_~p1~0); 33822#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 33820#L95-1 assume !(0 != main_~p3~0); 33816#L99-1 assume !(0 != main_~p4~0); 33813#L103-1 assume !(0 != main_~p5~0); 33814#L107-1 assume !(0 != main_~p6~0); 33748#L111-1 assume !(0 != main_~p7~0); 33750#L115-1 assume !(0 != main_~p8~0); 33884#L119-1 assume !(0 != main_~p9~0); 33722#L123-1 assume !(0 != main_~p10~0); 33724#L127-1 assume !(0 != main_~p11~0); 33707#L131-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 33708#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 33697#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 33698#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 33685#L147-1 assume !(0 != main_~p1~0); 33686#L153-1 assume 0 != main_~p2~0; 33674#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 33675#L158 assume !(0 != main_~p3~0); 33649#L163-1 assume !(0 != main_~p4~0); 33650#L168-1 assume !(0 != main_~p5~0); 33863#L173-1 assume !(0 != main_~p6~0); 33859#L178-1 assume !(0 != main_~p7~0); 33856#L183-1 assume !(0 != main_~p8~0); 33854#L188-1 assume !(0 != main_~p9~0); 33851#L193-1 assume !(0 != main_~p10~0); 33847#L198-1 assume !(0 != main_~p11~0); 33844#L203-1 assume !(0 != main_~p12~0); 33840#L208-1 assume !(0 != main_~p13~0); 33837#L213-1 assume 0 != main_~p14~0; 33835#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 33832#L218 assume !(0 != main_~p15~0); 33535#L223-1 [2019-11-25 08:56:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-25 08:56:38,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:38,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229191338] [2019-11-25 08:56:38,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:38,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2078666330, now seen corresponding path program 1 times [2019-11-25 08:56:38,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:38,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784571810] [2019-11-25 08:56:38,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:38,531 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-25 08:56:38,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784571810] [2019-11-25 08:56:38,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:38,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:38,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875949668] [2019-11-25 08:56:38,532 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:38,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:38,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:38,533 INFO L87 Difference]: Start difference. First operand 11009 states and 16129 transitions. cyclomatic complexity: 5376 Second operand 3 states. [2019-11-25 08:56:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:38,599 INFO L93 Difference]: Finished difference Result 21761 states and 31489 transitions. [2019-11-25 08:56:38,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:38,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21761 states and 31489 transitions. [2019-11-25 08:56:38,710 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-11-25 08:56:38,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21761 states to 21761 states and 31489 transitions. [2019-11-25 08:56:38,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21761 [2019-11-25 08:56:38,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21761 [2019-11-25 08:56:38,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21761 states and 31489 transitions. [2019-11-25 08:56:38,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:38,835 INFO L688 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-11-25 08:56:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21761 states and 31489 transitions. [2019-11-25 08:56:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21761 to 21761. [2019-11-25 08:56:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21761 states. [2019-11-25 08:56:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21761 states to 21761 states and 31489 transitions. [2019-11-25 08:56:39,222 INFO L711 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-11-25 08:56:39,222 INFO L591 BuchiCegarLoop]: Abstraction has 21761 states and 31489 transitions. [2019-11-25 08:56:39,222 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:56:39,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21761 states and 31489 transitions. [2019-11-25 08:56:39,289 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2019-11-25 08:56:39,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:39,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:39,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:39,291 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:39,291 INFO L794 eck$LassoCheckResult]: Stem: 66306#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 66307#L223-1 [2019-11-25 08:56:39,291 INFO L796 eck$LassoCheckResult]: Loop: 66307#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 66558#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 66555#L91 assume !(0 != main_~p1~0); 66552#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 66550#L95-1 assume !(0 != main_~p3~0); 66547#L99-1 assume !(0 != main_~p4~0); 66544#L103-1 assume !(0 != main_~p5~0); 66534#L107-1 assume !(0 != main_~p6~0); 66536#L111-1 assume !(0 != main_~p7~0); 66518#L115-1 assume !(0 != main_~p8~0); 66520#L119-1 assume !(0 != main_~p9~0); 66504#L123-1 assume !(0 != main_~p10~0); 66506#L127-1 assume !(0 != main_~p11~0); 66484#L131-1 assume !(0 != main_~p12~0); 66486#L135-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66469#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66470#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66460#L147-1 assume !(0 != main_~p1~0); 66461#L153-1 assume 0 != main_~p2~0; 66451#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 66452#L158 assume !(0 != main_~p3~0); 66423#L163-1 assume !(0 != main_~p4~0); 66424#L168-1 assume !(0 != main_~p5~0); 66590#L173-1 assume !(0 != main_~p6~0); 66588#L178-1 assume !(0 != main_~p7~0); 66586#L183-1 assume !(0 != main_~p8~0); 66584#L188-1 assume !(0 != main_~p9~0); 66582#L193-1 assume !(0 != main_~p10~0); 66578#L198-1 assume !(0 != main_~p11~0); 66574#L203-1 assume !(0 != main_~p12~0); 66571#L208-1 assume !(0 != main_~p13~0); 66567#L213-1 assume 0 != main_~p14~0; 66565#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 66563#L218 assume !(0 != main_~p15~0); 66307#L223-1 [2019-11-25 08:56:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-25 08:56:39,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:39,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26548465] [2019-11-25 08:56:39,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:39,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:39,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1655964504, now seen corresponding path program 1 times [2019-11-25 08:56:39,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:39,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065432739] [2019-11-25 08:56:39,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:39,342 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-25 08:56:39,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065432739] [2019-11-25 08:56:39,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:39,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:39,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573301875] [2019-11-25 08:56:39,343 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:39,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:39,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:39,344 INFO L87 Difference]: Start difference. First operand 21761 states and 31489 transitions. cyclomatic complexity: 10240 Second operand 3 states. [2019-11-25 08:56:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:39,465 INFO L93 Difference]: Finished difference Result 43009 states and 61441 transitions. [2019-11-25 08:56:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:39,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43009 states and 61441 transitions. [2019-11-25 08:56:39,681 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-11-25 08:56:39,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43009 states to 43009 states and 61441 transitions. [2019-11-25 08:56:39,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43009 [2019-11-25 08:56:39,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43009 [2019-11-25 08:56:39,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43009 states and 61441 transitions. [2019-11-25 08:56:39,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:39,907 INFO L688 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-11-25 08:56:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43009 states and 61441 transitions. [2019-11-25 08:56:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43009 to 43009. [2019-11-25 08:56:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-11-25 08:56:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 61441 transitions. [2019-11-25 08:56:40,796 INFO L711 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-11-25 08:56:40,796 INFO L591 BuchiCegarLoop]: Abstraction has 43009 states and 61441 transitions. [2019-11-25 08:56:40,796 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:56:40,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43009 states and 61441 transitions. [2019-11-25 08:56:40,906 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2019-11-25 08:56:40,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:40,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:40,908 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:40,908 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:40,908 INFO L794 eck$LassoCheckResult]: Stem: 131090#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 131091#L223-1 [2019-11-25 08:56:40,909 INFO L796 eck$LassoCheckResult]: Loop: 131091#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 131712#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 131710#L91 assume !(0 != main_~p1~0); 131709#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 131708#L95-1 assume !(0 != main_~p3~0); 131706#L99-1 assume !(0 != main_~p4~0); 131704#L103-1 assume !(0 != main_~p5~0); 131702#L107-1 assume !(0 != main_~p6~0); 131700#L111-1 assume !(0 != main_~p7~0); 131697#L115-1 assume !(0 != main_~p8~0); 131693#L119-1 assume !(0 != main_~p9~0); 131690#L123-1 assume !(0 != main_~p10~0); 131675#L127-1 assume !(0 != main_~p11~0); 131676#L131-1 assume !(0 != main_~p12~0); 131660#L135-1 assume !(0 != main_~p13~0); 131662#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131647#L143-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131648#L147-1 assume !(0 != main_~p1~0); 131635#L153-1 assume 0 != main_~p2~0; 131636#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 131622#L158 assume !(0 != main_~p3~0); 131621#L163-1 assume !(0 != main_~p4~0); 131604#L168-1 assume !(0 != main_~p5~0); 131606#L173-1 assume !(0 != main_~p6~0); 131593#L178-1 assume !(0 != main_~p7~0); 131594#L183-1 assume !(0 != main_~p8~0); 131576#L188-1 assume !(0 != main_~p9~0); 131578#L193-1 assume !(0 != main_~p10~0); 131721#L198-1 assume !(0 != main_~p11~0); 131719#L203-1 assume !(0 != main_~p12~0); 131717#L208-1 assume !(0 != main_~p13~0); 131716#L213-1 assume 0 != main_~p14~0; 131715#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 131714#L218 assume !(0 != main_~p15~0); 131091#L223-1 [2019-11-25 08:56:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:40,910 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 11 times [2019-11-25 08:56:40,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:40,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595964841] [2019-11-25 08:56:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:40,924 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:40,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1821354342, now seen corresponding path program 1 times [2019-11-25 08:56:40,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:40,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460704250] [2019-11-25 08:56:40,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:40,944 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-25 08:56:40,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460704250] [2019-11-25 08:56:40,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:40,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:40,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338672169] [2019-11-25 08:56:40,945 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:56:40,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:40,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:40,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:40,946 INFO L87 Difference]: Start difference. First operand 43009 states and 61441 transitions. cyclomatic complexity: 19456 Second operand 3 states. [2019-11-25 08:56:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:41,142 INFO L93 Difference]: Finished difference Result 84993 states and 119809 transitions. [2019-11-25 08:56:41,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:41,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84993 states and 119809 transitions. [2019-11-25 08:56:41,428 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-11-25 08:56:42,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84993 states to 84993 states and 119809 transitions. [2019-11-25 08:56:42,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84993 [2019-11-25 08:56:42,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84993 [2019-11-25 08:56:42,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84993 states and 119809 transitions. [2019-11-25 08:56:42,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:56:42,184 INFO L688 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-11-25 08:56:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84993 states and 119809 transitions. [2019-11-25 08:56:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84993 to 84993. [2019-11-25 08:56:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84993 states. [2019-11-25 08:56:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84993 states to 84993 states and 119809 transitions. [2019-11-25 08:56:43,427 INFO L711 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-11-25 08:56:43,427 INFO L591 BuchiCegarLoop]: Abstraction has 84993 states and 119809 transitions. [2019-11-25 08:56:43,428 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:56:43,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84993 states and 119809 transitions. [2019-11-25 08:56:43,586 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2019-11-25 08:56:43,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:56:43,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:56:43,588 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-25 08:56:43,588 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:43,588 INFO L794 eck$LassoCheckResult]: Stem: 259091#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_#t~nondet14, main_#t~nondet15, 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_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~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;main_~p14~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk15~0;havoc main_~cond~0; 259092#L223-1 [2019-11-25 08:56:43,589 INFO L796 eck$LassoCheckResult]: Loop: 259092#L223-1 assume !false;main_~cond~0 := main_#t~nondet15;havoc main_#t~nondet15; 259262#L56 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;main_~lk14~0 := 0;main_~lk15~0 := 0; 259258#L91 assume !(0 != main_~p1~0); 259254#L91-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 259250#L95-1 assume !(0 != main_~p3~0); 259243#L99-1 assume !(0 != main_~p4~0); 259235#L103-1 assume !(0 != main_~p5~0); 259227#L107-1 assume !(0 != main_~p6~0); 259219#L111-1 assume !(0 != main_~p7~0); 259211#L115-1 assume !(0 != main_~p8~0); 259203#L119-1 assume !(0 != main_~p9~0); 259195#L123-1 assume !(0 != main_~p10~0); 259190#L127-1 assume !(0 != main_~p11~0); 259183#L131-1 assume !(0 != main_~p12~0); 259175#L135-1 assume !(0 != main_~p13~0); 259170#L139-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 259165#L143-1 assume !(0 != main_~p15~0); 259159#L147-1 assume !(0 != main_~p1~0); 259160#L153-1 assume 0 != main_~p2~0; 259341#L159 assume !(1 != main_~lk2~0);main_~lk2~0 := 0; 259339#L158 assume !(0 != main_~p3~0); 259334#L163-1 assume !(0 != main_~p4~0); 259330#L168-1 assume !(0 != main_~p5~0); 259326#L173-1 assume !(0 != main_~p6~0); 259322#L178-1 assume !(0 != main_~p7~0); 259318#L183-1 assume !(0 != main_~p8~0); 259314#L188-1 assume !(0 != main_~p9~0); 259306#L193-1 assume !(0 != main_~p10~0); 259296#L198-1 assume !(0 != main_~p11~0); 259288#L203-1 assume !(0 != main_~p12~0); 259281#L208-1 assume !(0 != main_~p13~0); 259277#L213-1 assume 0 != main_~p14~0; 259273#L219 assume !(1 != main_~lk14~0);main_~lk14~0 := 0; 259269#L218 assume !(0 != main_~p15~0); 259092#L223-1 [2019-11-25 08:56:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 12 times [2019-11-25 08:56:43,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137615642] [2019-11-25 08:56:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:43,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -172790364, now seen corresponding path program 1 times [2019-11-25 08:56:43,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226379361] [2019-11-25 08:56:43,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:43,611 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1777509891, now seen corresponding path program 1 times [2019-11-25 08:56:43,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86039423] [2019-11-25 08:56:43,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:43,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:43,822 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-25 08:56:43,979 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-25 08:56:44,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:56:44 BoogieIcfgContainer [2019-11-25 08:56:44,127 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:56:44,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:44,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:44,129 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:44,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:35" (3/4) ... [2019-11-25 08:56:44,133 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-25 08:56:44,222 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_012aac8b-1aa6-40c3-a794-d65d60fe50b3/bin/uautomizer/witness.graphml [2019-11-25 08:56:44,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:44,224 INFO L168 Benchmark]: Toolchain (without parser) took 9321.92 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 784.9 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 622.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,224 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:44,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:44,228 INFO L168 Benchmark]: Boogie Preprocessor took 38.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:44,229 INFO L168 Benchmark]: RCFGBuilder took 439.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,229 INFO L168 Benchmark]: BuchiAutomizer took 8374.36 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 685.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -56.4 MB). Peak memory consumption was 628.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:44,230 INFO L168 Benchmark]: Witness Printer took 94.03 ms. Allocated memory is still 1.8 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-25 08:56:44,232 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 439.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8374.36 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 685.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -56.4 MB). Peak memory consumption was 628.8 MB. Max. memory is 11.5 GB. * Witness Printer took 94.03 ms. Allocated memory is still 1.8 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. * 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 84993 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. 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 3.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.9s Buchi closure took 0.1s. Biggest automaton had 84993 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1260 SDtfs, 648 SDslu, 790 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: 54]: 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=3, p5=0, p10=0, p4=0, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2167c4ac=0, p9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15f68b08=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59c84aa8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4865e50e=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2252cef6=0, lk13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@770ccf9b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16bb492f=0, p15=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68d12772=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@464d04fe=0, lk15=0, p13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6361278b=0, p14=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d6b36cd=0, p11=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38ad116f=0, lk11=0, cond=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49de5fab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52d8c132=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43b9bce5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2232f957=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0, lk9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: 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; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L48] int p15 = __VERIFIER_nondet_int(); [L49] int lk15; [L52] int cond; Loop: [L54] COND TRUE 1 [L55] cond = __VERIFIER_nondet_int() [L56] COND FALSE !(cond == 0) [L59] lk1 = 0 [L61] lk2 = 0 [L63] lk3 = 0 [L65] lk4 = 0 [L67] lk5 = 0 [L69] lk6 = 0 [L71] lk7 = 0 [L73] lk8 = 0 [L75] lk9 = 0 [L77] lk10 = 0 [L79] lk11 = 0 [L81] lk12 = 0 [L83] lk13 = 0 [L85] lk14 = 0 [L87] lk15 = 0 [L91] COND FALSE !(p1 != 0) [L95] COND TRUE p2 != 0 [L96] lk2 = 1 [L99] COND FALSE !(p3 != 0) [L103] COND FALSE !(p4 != 0) [L107] COND FALSE !(p5 != 0) [L111] COND FALSE !(p6 != 0) [L115] COND FALSE !(p7 != 0) [L119] COND FALSE !(p8 != 0) [L123] COND FALSE !(p9 != 0) [L127] COND FALSE !(p10 != 0) [L131] COND FALSE !(p11 != 0) [L135] COND FALSE !(p12 != 0) [L139] COND FALSE !(p13 != 0) [L143] COND TRUE p14 != 0 [L144] lk14 = 1 [L147] COND FALSE !(p15 != 0) [L153] COND FALSE !(p1 != 0) [L158] COND TRUE p2 != 0 [L159] COND FALSE !(lk2 != 1) [L160] lk2 = 0 [L163] COND FALSE !(p3 != 0) [L168] COND FALSE !(p4 != 0) [L173] COND FALSE !(p5 != 0) [L178] COND FALSE !(p6 != 0) [L183] COND FALSE !(p7 != 0) [L188] COND FALSE !(p8 != 0) [L193] COND FALSE !(p9 != 0) [L198] COND FALSE !(p10 != 0) [L203] COND FALSE !(p11 != 0) [L208] COND FALSE !(p12 != 0) [L213] COND FALSE !(p13 != 0) [L218] COND TRUE p14 != 0 [L219] COND FALSE !(lk14 != 1) [L220] lk14 = 0 [L223] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...