./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 532163d21d7e473fbfa4a073427e9fd2a45c7337 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:08:11,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:08:11,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:08:11,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:08:11,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:08:11,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:08:11,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:08:11,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:08:11,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:08:11,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:08:11,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:08:11,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:08:11,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:08:11,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:08:11,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:08:11,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:08:11,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:08:11,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:08:11,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:08:11,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:08:11,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:08:11,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:08:11,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:08:11,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:08:11,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:08:11,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:08:11,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:08:11,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:08:11,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:08:11,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:08:11,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:08:11,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:08:11,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:08:11,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:08:11,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:08:11,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:08:11,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:08:11,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:08:11,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:08:11,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:08:11,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:08:11,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:08:11,182 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:08:11,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:08:11,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:08:11,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:08:11,185 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:08:11,185 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:08:11,185 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:08:11,186 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:08:11,186 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:08:11,186 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:08:11,186 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:08:11,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:08:11,187 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:08:11,187 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:08:11,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:08:11,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:08:11,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:08:11,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:08:11,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:08:11,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:08:11,189 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:08:11,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:08:11,190 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:08:11,190 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:08:11,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:08:11,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:08:11,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:08:11,191 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:08:11,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:08:11,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:08:11,192 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:08:11,192 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:08:11,193 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:08:11,194 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 532163d21d7e473fbfa4a073427e9fd2a45c7337 [2020-07-29 03:08:11,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:08:11,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:08:11,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:08:11,558 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:08:11,559 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:08:11,559 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2020-07-29 03:08:11,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53999e89e/4c000f9676a844ec987f993c585bf50d/FLAG429ddbde7 [2020-07-29 03:08:12,153 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:08:12,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2020-07-29 03:08:12,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53999e89e/4c000f9676a844ec987f993c585bf50d/FLAG429ddbde7 [2020-07-29 03:08:12,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53999e89e/4c000f9676a844ec987f993c585bf50d [2020-07-29 03:08:12,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:08:12,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:08:12,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:08:12,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:08:12,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:08:12,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:12,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a84426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12, skipping insertion in model container [2020-07-29 03:08:12,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:12,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:08:12,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:08:12,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:08:12,766 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:08:12,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:08:12,907 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:08:12,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12 WrapperNode [2020-07-29 03:08:12,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:08:12,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:08:12,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:08:12,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:08:12,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:12,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:12,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:08:12,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:08:12,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:08:12,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:08:12,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:12,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:12,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:12,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:13,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:13,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:13,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... [2020-07-29 03:08:13,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:08:13,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:08:13,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:08:13,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:08:13,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:08:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:08:13,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:08:13,892 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:08:13,893 INFO L295 CfgBuilder]: Removed 72 assume(true) statements. [2020-07-29 03:08:13,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:08:13 BoogieIcfgContainer [2020-07-29 03:08:13,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:08:13,899 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:08:13,900 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:08:13,904 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:08:13,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:08:13,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:08:12" (1/3) ... [2020-07-29 03:08:13,906 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@423b08b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:08:13, skipping insertion in model container [2020-07-29 03:08:13,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:08:13,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:08:12" (2/3) ... [2020-07-29 03:08:13,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@423b08b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:08:13, skipping insertion in model container [2020-07-29 03:08:13,908 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:08:13,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:08:13" (3/3) ... [2020-07-29 03:08:13,910 INFO L371 chiAutomizerObserver]: Analyzing ICFG kundu1.cil.c [2020-07-29 03:08:13,965 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:08:13,965 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:08:13,965 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:08:13,966 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:08:13,966 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:08:13,966 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:08:13,967 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:08:13,967 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:08:13,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states. [2020-07-29 03:08:14,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:08:14,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:14,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:14,048 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:14,048 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] [2020-07-29 03:08:14,049 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:08:14,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states. [2020-07-29 03:08:14,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-07-29 03:08:14,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:14,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:14,071 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:14,072 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] [2020-07-29 03:08:14,080 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 13#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 19#L486true havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5#L219true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 67#L226-1true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 75#L231-1true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 94#L107true assume 1 == ~P_1_pc~0; 57#L108true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 95#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 58#L119true activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 27#L373true assume !(0 != activate_threads_~tmp~1); 15#L373-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 104#L189true assume 1 == ~C_1_pc~0; 62#L190true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 38#L210true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 107#L211true activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 31#L381true assume !(0 != activate_threads_~tmp___1~1); 68#L435-1true [2020-07-29 03:08:14,081 INFO L796 eck$LassoCheckResult]: Loop: 68#L435-1true assume !false; 29#L436true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 89#L294true assume false; 11#L310true start_simulation_~kernel_st~0 := 2; 3#L219-1true start_simulation_~kernel_st~0 := 3; 9#L321true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 77#L107-3true assume 1 == ~P_1_pc~0; 53#L108-1true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 93#L118-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 55#L119-1true activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 16#L373-3true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 20#L373-5true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 96#L189-3true assume 1 == ~C_1_pc~0; 60#L190-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 36#L210-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 102#L211-1true activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 32#L381-3true assume !(0 != activate_threads_~tmp___1~1); 23#L381-5true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 108#L244-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 42#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 113#L258-1true start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 83#L454true assume !(0 == start_simulation_~tmp~3); 85#L454-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 103#L244-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 41#L257-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 111#L258-2true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 4#L409true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 61#L416true stop_simulation_#res := stop_simulation_~__retres2~0; 25#L417true start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 112#L467true assume !(0 != start_simulation_~tmp___0~2); 68#L435-1true [2020-07-29 03:08:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1468371184, now seen corresponding path program 1 times [2020-07-29 03:08:14,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:14,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99957582] [2020-07-29 03:08:14,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:14,278 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#true} ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; {118#true} is VALID [2020-07-29 03:08:14,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; {120#(= 1 ~P_1_i~0)} is VALID [2020-07-29 03:08:14,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {120#(= 1 ~P_1_i~0)} havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; {120#(= 1 ~P_1_i~0)} is VALID [2020-07-29 03:08:14,282 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#(= 1 ~P_1_i~0)} assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; {119#false} is VALID [2020-07-29 03:08:14,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {119#false} assume 1 == ~C_1_i~0;~C_1_st~0 := 0; {119#false} is VALID [2020-07-29 03:08:14,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {119#false} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {119#false} is VALID [2020-07-29 03:08:14,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {119#false} assume 1 == ~P_1_pc~0; {119#false} is VALID [2020-07-29 03:08:14,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {119#false} assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; {119#false} is VALID [2020-07-29 03:08:14,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {119#false} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {119#false} is VALID [2020-07-29 03:08:14,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {119#false} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {119#false} is VALID [2020-07-29 03:08:14,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {119#false} assume !(0 != activate_threads_~tmp~1); {119#false} is VALID [2020-07-29 03:08:14,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {119#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {119#false} is VALID [2020-07-29 03:08:14,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {119#false} assume 1 == ~C_1_pc~0; {119#false} is VALID [2020-07-29 03:08:14,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {119#false} assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; {119#false} is VALID [2020-07-29 03:08:14,287 INFO L280 TraceCheckUtils]: 14: Hoare triple {119#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {119#false} is VALID [2020-07-29 03:08:14,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {119#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {119#false} is VALID [2020-07-29 03:08:14,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {119#false} assume !(0 != activate_threads_~tmp___1~1); {119#false} is VALID [2020-07-29 03:08:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:14,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99957582] [2020-07-29 03:08:14,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:14,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:08:14,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435358614] [2020-07-29 03:08:14,301 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:08:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash 101330720, now seen corresponding path program 1 times [2020-07-29 03:08:14,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:14,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143632753] [2020-07-29 03:08:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:14,323 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} assume !false; {121#true} is VALID [2020-07-29 03:08:14,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {121#true} is VALID [2020-07-29 03:08:14,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {121#true} assume false; {122#false} is VALID [2020-07-29 03:08:14,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {122#false} start_simulation_~kernel_st~0 := 2; {122#false} is VALID [2020-07-29 03:08:14,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {122#false} start_simulation_~kernel_st~0 := 3; {122#false} is VALID [2020-07-29 03:08:14,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#false} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {122#false} is VALID [2020-07-29 03:08:14,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {122#false} assume 1 == ~P_1_pc~0; {122#false} is VALID [2020-07-29 03:08:14,326 INFO L280 TraceCheckUtils]: 7: Hoare triple {122#false} assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; {122#false} is VALID [2020-07-29 03:08:14,326 INFO L280 TraceCheckUtils]: 8: Hoare triple {122#false} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {122#false} is VALID [2020-07-29 03:08:14,327 INFO L280 TraceCheckUtils]: 9: Hoare triple {122#false} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {122#false} is VALID [2020-07-29 03:08:14,327 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#false} assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; {122#false} is VALID [2020-07-29 03:08:14,327 INFO L280 TraceCheckUtils]: 11: Hoare triple {122#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {122#false} is VALID [2020-07-29 03:08:14,328 INFO L280 TraceCheckUtils]: 12: Hoare triple {122#false} assume 1 == ~C_1_pc~0; {122#false} is VALID [2020-07-29 03:08:14,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {122#false} assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; {122#false} is VALID [2020-07-29 03:08:14,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {122#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {122#false} is VALID [2020-07-29 03:08:14,329 INFO L280 TraceCheckUtils]: 15: Hoare triple {122#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {122#false} is VALID [2020-07-29 03:08:14,329 INFO L280 TraceCheckUtils]: 16: Hoare triple {122#false} assume !(0 != activate_threads_~tmp___1~1); {122#false} is VALID [2020-07-29 03:08:14,329 INFO L280 TraceCheckUtils]: 17: Hoare triple {122#false} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {122#false} is VALID [2020-07-29 03:08:14,330 INFO L280 TraceCheckUtils]: 18: Hoare triple {122#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {122#false} is VALID [2020-07-29 03:08:14,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {122#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {122#false} is VALID [2020-07-29 03:08:14,330 INFO L280 TraceCheckUtils]: 20: Hoare triple {122#false} start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; {122#false} is VALID [2020-07-29 03:08:14,331 INFO L280 TraceCheckUtils]: 21: Hoare triple {122#false} assume !(0 == start_simulation_~tmp~3); {122#false} is VALID [2020-07-29 03:08:14,331 INFO L280 TraceCheckUtils]: 22: Hoare triple {122#false} havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {122#false} is VALID [2020-07-29 03:08:14,331 INFO L280 TraceCheckUtils]: 23: Hoare triple {122#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {122#false} is VALID [2020-07-29 03:08:14,332 INFO L280 TraceCheckUtils]: 24: Hoare triple {122#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {122#false} is VALID [2020-07-29 03:08:14,332 INFO L280 TraceCheckUtils]: 25: Hoare triple {122#false} stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; {122#false} is VALID [2020-07-29 03:08:14,332 INFO L280 TraceCheckUtils]: 26: Hoare triple {122#false} assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; {122#false} is VALID [2020-07-29 03:08:14,333 INFO L280 TraceCheckUtils]: 27: Hoare triple {122#false} stop_simulation_#res := stop_simulation_~__retres2~0; {122#false} is VALID [2020-07-29 03:08:14,333 INFO L280 TraceCheckUtils]: 28: Hoare triple {122#false} start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; {122#false} is VALID [2020-07-29 03:08:14,334 INFO L280 TraceCheckUtils]: 29: Hoare triple {122#false} assume !(0 != start_simulation_~tmp___0~2); {122#false} is VALID [2020-07-29 03:08:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:14,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143632753] [2020-07-29 03:08:14,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:14,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:08:14,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429971060] [2020-07-29 03:08:14,340 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:08:14,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:08:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:08:14,358 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2020-07-29 03:08:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:14,597 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2020-07-29 03:08:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:08:14,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:08:14,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:14,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 163 transitions. [2020-07-29 03:08:14,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2020-07-29 03:08:14,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 156 transitions. [2020-07-29 03:08:14,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2020-07-29 03:08:14,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2020-07-29 03:08:14,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 156 transitions. [2020-07-29 03:08:14,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:14,668 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2020-07-29 03:08:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 156 transitions. [2020-07-29 03:08:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-07-29 03:08:14,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:14,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states and 156 transitions. Second operand 106 states. [2020-07-29 03:08:14,708 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states and 156 transitions. Second operand 106 states. [2020-07-29 03:08:14,710 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand 106 states. [2020-07-29 03:08:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:14,718 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2020-07-29 03:08:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2020-07-29 03:08:14,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:14,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:14,721 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states and 156 transitions. [2020-07-29 03:08:14,721 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states and 156 transitions. [2020-07-29 03:08:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:14,728 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2020-07-29 03:08:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2020-07-29 03:08:14,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:14,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:14,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:14,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-29 03:08:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2020-07-29 03:08:14,738 INFO L711 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2020-07-29 03:08:14,738 INFO L591 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2020-07-29 03:08:14,738 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:08:14,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 156 transitions. [2020-07-29 03:08:14,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2020-07-29 03:08:14,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:14,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:14,749 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:14,749 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, 1] [2020-07-29 03:08:14,750 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 254#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 255#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 240#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 241#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 328#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 333#L107 assume 1 == ~P_1_pc~0; 314#L108 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 315#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 317#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 277#L373 assume !(0 != activate_threads_~tmp~1); 257#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 258#L189 assume 1 == ~C_1_pc~0; 322#L190 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 286#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 290#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 280#L381 assume !(0 != activate_threads_~tmp___1~1); 281#L435-1 [2020-07-29 03:08:14,750 INFO L796 eck$LassoCheckResult]: Loop: 281#L435-1 assume !false; 279#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 275#L294 assume !false; 331#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 332#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 295#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 296#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 249#L274 assume !(0 != eval_~tmp___2~0); 250#L310 start_simulation_~kernel_st~0 := 2; 236#L219-1 start_simulation_~kernel_st~0 := 3; 237#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 251#L107-3 assume 1 == ~P_1_pc~0; 309#L108-1 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 311#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 312#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 259#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 260#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 266#L189-3 assume 1 == ~C_1_pc~0; 320#L190-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 288#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 289#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 282#L381-3 assume !(0 != activate_threads_~tmp___1~1); 268#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 269#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 293#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 294#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 336#L454 assume !(0 == start_simulation_~tmp~3); 313#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 337#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 291#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 292#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 238#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 239#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 272#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 273#L467 assume !(0 != start_simulation_~tmp___0~2); 281#L435-1 [2020-07-29 03:08:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash -457253934, now seen corresponding path program 1 times [2020-07-29 03:08:14,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:14,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333119362] [2020-07-29 03:08:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:14,812 INFO L280 TraceCheckUtils]: 0: Hoare triple {557#true} ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; {557#true} is VALID [2020-07-29 03:08:14,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; {559#(<= ~P_1_pc~0 0)} is VALID [2020-07-29 03:08:14,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {559#(<= ~P_1_pc~0 0)} havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; {559#(<= ~P_1_pc~0 0)} is VALID [2020-07-29 03:08:14,816 INFO L280 TraceCheckUtils]: 3: Hoare triple {559#(<= ~P_1_pc~0 0)} assume 1 == ~P_1_i~0;~P_1_st~0 := 0; {559#(<= ~P_1_pc~0 0)} is VALID [2020-07-29 03:08:14,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {559#(<= ~P_1_pc~0 0)} assume 1 == ~C_1_i~0;~C_1_st~0 := 0; {559#(<= ~P_1_pc~0 0)} is VALID [2020-07-29 03:08:14,817 INFO L280 TraceCheckUtils]: 5: Hoare triple {559#(<= ~P_1_pc~0 0)} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {559#(<= ~P_1_pc~0 0)} is VALID [2020-07-29 03:08:14,818 INFO L280 TraceCheckUtils]: 6: Hoare triple {559#(<= ~P_1_pc~0 0)} assume 1 == ~P_1_pc~0; {558#false} is VALID [2020-07-29 03:08:14,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {558#false} assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; {558#false} is VALID [2020-07-29 03:08:14,819 INFO L280 TraceCheckUtils]: 8: Hoare triple {558#false} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {558#false} is VALID [2020-07-29 03:08:14,820 INFO L280 TraceCheckUtils]: 9: Hoare triple {558#false} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {558#false} is VALID [2020-07-29 03:08:14,820 INFO L280 TraceCheckUtils]: 10: Hoare triple {558#false} assume !(0 != activate_threads_~tmp~1); {558#false} is VALID [2020-07-29 03:08:14,820 INFO L280 TraceCheckUtils]: 11: Hoare triple {558#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {558#false} is VALID [2020-07-29 03:08:14,821 INFO L280 TraceCheckUtils]: 12: Hoare triple {558#false} assume 1 == ~C_1_pc~0; {558#false} is VALID [2020-07-29 03:08:14,821 INFO L280 TraceCheckUtils]: 13: Hoare triple {558#false} assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; {558#false} is VALID [2020-07-29 03:08:14,821 INFO L280 TraceCheckUtils]: 14: Hoare triple {558#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {558#false} is VALID [2020-07-29 03:08:14,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {558#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {558#false} is VALID [2020-07-29 03:08:14,822 INFO L280 TraceCheckUtils]: 16: Hoare triple {558#false} assume !(0 != activate_threads_~tmp___1~1); {558#false} is VALID [2020-07-29 03:08:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:14,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333119362] [2020-07-29 03:08:14,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:14,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:08:14,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871809366] [2020-07-29 03:08:14,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:08:14,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash 513684202, now seen corresponding path program 1 times [2020-07-29 03:08:14,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:14,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331276685] [2020-07-29 03:08:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:14,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} assume !false; {560#true} is VALID [2020-07-29 03:08:14,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {560#true} is VALID [2020-07-29 03:08:14,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume !false; {560#true} is VALID [2020-07-29 03:08:14,925 INFO L280 TraceCheckUtils]: 3: Hoare triple {560#true} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {560#true} is VALID [2020-07-29 03:08:14,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {560#true} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {562#(<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)} is VALID [2020-07-29 03:08:14,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#(<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {563#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res|)} is VALID [2020-07-29 03:08:14,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {563#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res|)} eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; {564#(<= 1 ULTIMATE.start_eval_~tmp___2~0)} is VALID [2020-07-29 03:08:14,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#(<= 1 ULTIMATE.start_eval_~tmp___2~0)} assume !(0 != eval_~tmp___2~0); {561#false} is VALID [2020-07-29 03:08:14,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {561#false} start_simulation_~kernel_st~0 := 2; {561#false} is VALID [2020-07-29 03:08:14,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {561#false} start_simulation_~kernel_st~0 := 3; {561#false} is VALID [2020-07-29 03:08:14,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {561#false} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {561#false} is VALID [2020-07-29 03:08:14,933 INFO L280 TraceCheckUtils]: 11: Hoare triple {561#false} assume 1 == ~P_1_pc~0; {561#false} is VALID [2020-07-29 03:08:14,933 INFO L280 TraceCheckUtils]: 12: Hoare triple {561#false} assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; {561#false} is VALID [2020-07-29 03:08:14,933 INFO L280 TraceCheckUtils]: 13: Hoare triple {561#false} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {561#false} is VALID [2020-07-29 03:08:14,934 INFO L280 TraceCheckUtils]: 14: Hoare triple {561#false} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {561#false} is VALID [2020-07-29 03:08:14,934 INFO L280 TraceCheckUtils]: 15: Hoare triple {561#false} assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; {561#false} is VALID [2020-07-29 03:08:14,934 INFO L280 TraceCheckUtils]: 16: Hoare triple {561#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {561#false} is VALID [2020-07-29 03:08:14,934 INFO L280 TraceCheckUtils]: 17: Hoare triple {561#false} assume 1 == ~C_1_pc~0; {561#false} is VALID [2020-07-29 03:08:14,935 INFO L280 TraceCheckUtils]: 18: Hoare triple {561#false} assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; {561#false} is VALID [2020-07-29 03:08:14,935 INFO L280 TraceCheckUtils]: 19: Hoare triple {561#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {561#false} is VALID [2020-07-29 03:08:14,936 INFO L280 TraceCheckUtils]: 20: Hoare triple {561#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {561#false} is VALID [2020-07-29 03:08:14,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {561#false} assume !(0 != activate_threads_~tmp___1~1); {561#false} is VALID [2020-07-29 03:08:14,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {561#false} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {561#false} is VALID [2020-07-29 03:08:14,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {561#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {561#false} is VALID [2020-07-29 03:08:14,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {561#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {561#false} is VALID [2020-07-29 03:08:14,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {561#false} start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; {561#false} is VALID [2020-07-29 03:08:14,938 INFO L280 TraceCheckUtils]: 26: Hoare triple {561#false} assume !(0 == start_simulation_~tmp~3); {561#false} is VALID [2020-07-29 03:08:14,939 INFO L280 TraceCheckUtils]: 27: Hoare triple {561#false} havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {561#false} is VALID [2020-07-29 03:08:14,939 INFO L280 TraceCheckUtils]: 28: Hoare triple {561#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {561#false} is VALID [2020-07-29 03:08:14,939 INFO L280 TraceCheckUtils]: 29: Hoare triple {561#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {561#false} is VALID [2020-07-29 03:08:14,940 INFO L280 TraceCheckUtils]: 30: Hoare triple {561#false} stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; {561#false} is VALID [2020-07-29 03:08:14,940 INFO L280 TraceCheckUtils]: 31: Hoare triple {561#false} assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; {561#false} is VALID [2020-07-29 03:08:14,940 INFO L280 TraceCheckUtils]: 32: Hoare triple {561#false} stop_simulation_#res := stop_simulation_~__retres2~0; {561#false} is VALID [2020-07-29 03:08:14,941 INFO L280 TraceCheckUtils]: 33: Hoare triple {561#false} start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; {561#false} is VALID [2020-07-29 03:08:14,941 INFO L280 TraceCheckUtils]: 34: Hoare triple {561#false} assume !(0 != start_simulation_~tmp___0~2); {561#false} is VALID [2020-07-29 03:08:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:14,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331276685] [2020-07-29 03:08:14,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:14,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:08:14,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329978581] [2020-07-29 03:08:14,946 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:08:14,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:08:14,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:08:14,948 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. cyclomatic complexity: 51 Second operand 3 states. [2020-07-29 03:08:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:15,267 INFO L93 Difference]: Finished difference Result 188 states and 272 transitions. [2020-07-29 03:08:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:08:15,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:08:15,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:15,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 272 transitions. [2020-07-29 03:08:15,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 168 [2020-07-29 03:08:15,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 272 transitions. [2020-07-29 03:08:15,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2020-07-29 03:08:15,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2020-07-29 03:08:15,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 272 transitions. [2020-07-29 03:08:15,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:15,336 INFO L688 BuchiCegarLoop]: Abstraction has 188 states and 272 transitions. [2020-07-29 03:08:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 272 transitions. [2020-07-29 03:08:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2020-07-29 03:08:15,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:15,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states and 272 transitions. Second operand 184 states. [2020-07-29 03:08:15,369 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states and 272 transitions. Second operand 184 states. [2020-07-29 03:08:15,369 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand 184 states. [2020-07-29 03:08:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:15,388 INFO L93 Difference]: Finished difference Result 188 states and 272 transitions. [2020-07-29 03:08:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2020-07-29 03:08:15,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:15,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:15,395 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 188 states and 272 transitions. [2020-07-29 03:08:15,396 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 188 states and 272 transitions. [2020-07-29 03:08:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:15,407 INFO L93 Difference]: Finished difference Result 188 states and 272 transitions. [2020-07-29 03:08:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2020-07-29 03:08:15,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:15,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:15,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:15,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-29 03:08:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2020-07-29 03:08:15,417 INFO L711 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2020-07-29 03:08:15,417 INFO L591 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2020-07-29 03:08:15,417 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:08:15,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 267 transitions. [2020-07-29 03:08:15,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 164 [2020-07-29 03:08:15,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:15,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:15,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:15,424 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, 1] [2020-07-29 03:08:15,424 INFO L794 eck$LassoCheckResult]: Stem: 861#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 772#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 773#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 757#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 758#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 849#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 856#L107 assume !(1 == ~P_1_pc~0); 858#L107-2 is_P_1_triggered_~__retres1~0 := 0; 859#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 835#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 795#L373 assume !(0 != activate_threads_~tmp~1); 775#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 776#L189 assume 1 == ~C_1_pc~0; 840#L190 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 805#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 809#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 799#L381 assume !(0 != activate_threads_~tmp___1~1); 800#L435-1 [2020-07-29 03:08:15,425 INFO L796 eck$LassoCheckResult]: Loop: 800#L435-1 assume !false; 893#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 891#L294 assume !false; 853#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 854#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 814#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 815#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 766#L274 assume !(0 != eval_~tmp___2~0); 768#L310 start_simulation_~kernel_st~0 := 2; 753#L219-1 start_simulation_~kernel_st~0 := 3; 754#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 769#L107-3 assume !(1 == ~P_1_pc~0); 857#L107-5 is_P_1_triggered_~__retres1~0 := 0; 923#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 922#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 921#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 920#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 919#L189-3 assume 1 == ~C_1_pc~0; 917#L190-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 807#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 808#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 801#L381-3 assume !(0 != activate_threads_~tmp___1~1); 786#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 787#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 812#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 813#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 862#L454 assume !(0 == start_simulation_~tmp~3); 863#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 924#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 810#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 811#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 755#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 756#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 790#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 791#L467 assume !(0 != start_simulation_~tmp___0~2); 800#L435-1 [2020-07-29 03:08:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1330092589, now seen corresponding path program 1 times [2020-07-29 03:08:15,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:15,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086238069] [2020-07-29 03:08:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:15,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {1316#true} ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; {1316#true} is VALID [2020-07-29 03:08:15,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {1316#true} havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {1318#(<= ~C_1_pc~0 0)} havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,489 INFO L280 TraceCheckUtils]: 3: Hoare triple {1318#(<= ~C_1_pc~0 0)} assume 1 == ~P_1_i~0;~P_1_st~0 := 0; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {1318#(<= ~C_1_pc~0 0)} assume 1 == ~C_1_i~0;~C_1_st~0 := 0; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {1318#(<= ~C_1_pc~0 0)} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {1318#(<= ~C_1_pc~0 0)} assume !(1 == ~P_1_pc~0); {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {1318#(<= ~C_1_pc~0 0)} is_P_1_triggered_~__retres1~0 := 0; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {1318#(<= ~C_1_pc~0 0)} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {1318#(<= ~C_1_pc~0 0)} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {1318#(<= ~C_1_pc~0 0)} assume !(0 != activate_threads_~tmp~1); {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {1318#(<= ~C_1_pc~0 0)} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {1318#(<= ~C_1_pc~0 0)} is VALID [2020-07-29 03:08:15,497 INFO L280 TraceCheckUtils]: 12: Hoare triple {1318#(<= ~C_1_pc~0 0)} assume 1 == ~C_1_pc~0; {1317#false} is VALID [2020-07-29 03:08:15,498 INFO L280 TraceCheckUtils]: 13: Hoare triple {1317#false} assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; {1317#false} is VALID [2020-07-29 03:08:15,498 INFO L280 TraceCheckUtils]: 14: Hoare triple {1317#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {1317#false} is VALID [2020-07-29 03:08:15,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {1317#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {1317#false} is VALID [2020-07-29 03:08:15,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {1317#false} assume !(0 != activate_threads_~tmp___1~1); {1317#false} is VALID [2020-07-29 03:08:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:15,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086238069] [2020-07-29 03:08:15,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:15,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:08:15,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330425865] [2020-07-29 03:08:15,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:08:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:15,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 1 times [2020-07-29 03:08:15,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:15,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628777280] [2020-07-29 03:08:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:15,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {1319#true} assume !false; {1319#true} is VALID [2020-07-29 03:08:15,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {1319#true} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {1319#true} is VALID [2020-07-29 03:08:15,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {1319#true} assume !false; {1319#true} is VALID [2020-07-29 03:08:15,559 INFO L280 TraceCheckUtils]: 3: Hoare triple {1319#true} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {1319#true} is VALID [2020-07-29 03:08:15,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {1319#true} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {1321#(<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)} is VALID [2020-07-29 03:08:15,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {1321#(<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {1322#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res|)} is VALID [2020-07-29 03:08:15,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {1322#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res|)} eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; {1323#(<= 1 ULTIMATE.start_eval_~tmp___2~0)} is VALID [2020-07-29 03:08:15,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {1323#(<= 1 ULTIMATE.start_eval_~tmp___2~0)} assume !(0 != eval_~tmp___2~0); {1320#false} is VALID [2020-07-29 03:08:15,564 INFO L280 TraceCheckUtils]: 8: Hoare triple {1320#false} start_simulation_~kernel_st~0 := 2; {1320#false} is VALID [2020-07-29 03:08:15,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {1320#false} start_simulation_~kernel_st~0 := 3; {1320#false} is VALID [2020-07-29 03:08:15,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {1320#false} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {1320#false} is VALID [2020-07-29 03:08:15,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {1320#false} assume !(1 == ~P_1_pc~0); {1320#false} is VALID [2020-07-29 03:08:15,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {1320#false} is_P_1_triggered_~__retres1~0 := 0; {1320#false} is VALID [2020-07-29 03:08:15,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {1320#false} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {1320#false} is VALID [2020-07-29 03:08:15,565 INFO L280 TraceCheckUtils]: 14: Hoare triple {1320#false} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {1320#false} is VALID [2020-07-29 03:08:15,566 INFO L280 TraceCheckUtils]: 15: Hoare triple {1320#false} assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; {1320#false} is VALID [2020-07-29 03:08:15,566 INFO L280 TraceCheckUtils]: 16: Hoare triple {1320#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {1320#false} is VALID [2020-07-29 03:08:15,567 INFO L280 TraceCheckUtils]: 17: Hoare triple {1320#false} assume 1 == ~C_1_pc~0; {1320#false} is VALID [2020-07-29 03:08:15,567 INFO L280 TraceCheckUtils]: 18: Hoare triple {1320#false} assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; {1320#false} is VALID [2020-07-29 03:08:15,567 INFO L280 TraceCheckUtils]: 19: Hoare triple {1320#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {1320#false} is VALID [2020-07-29 03:08:15,567 INFO L280 TraceCheckUtils]: 20: Hoare triple {1320#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {1320#false} is VALID [2020-07-29 03:08:15,568 INFO L280 TraceCheckUtils]: 21: Hoare triple {1320#false} assume !(0 != activate_threads_~tmp___1~1); {1320#false} is VALID [2020-07-29 03:08:15,568 INFO L280 TraceCheckUtils]: 22: Hoare triple {1320#false} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {1320#false} is VALID [2020-07-29 03:08:15,568 INFO L280 TraceCheckUtils]: 23: Hoare triple {1320#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {1320#false} is VALID [2020-07-29 03:08:15,569 INFO L280 TraceCheckUtils]: 24: Hoare triple {1320#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {1320#false} is VALID [2020-07-29 03:08:15,569 INFO L280 TraceCheckUtils]: 25: Hoare triple {1320#false} start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; {1320#false} is VALID [2020-07-29 03:08:15,570 INFO L280 TraceCheckUtils]: 26: Hoare triple {1320#false} assume !(0 == start_simulation_~tmp~3); {1320#false} is VALID [2020-07-29 03:08:15,570 INFO L280 TraceCheckUtils]: 27: Hoare triple {1320#false} havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {1320#false} is VALID [2020-07-29 03:08:15,571 INFO L280 TraceCheckUtils]: 28: Hoare triple {1320#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {1320#false} is VALID [2020-07-29 03:08:15,571 INFO L280 TraceCheckUtils]: 29: Hoare triple {1320#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {1320#false} is VALID [2020-07-29 03:08:15,571 INFO L280 TraceCheckUtils]: 30: Hoare triple {1320#false} stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; {1320#false} is VALID [2020-07-29 03:08:15,572 INFO L280 TraceCheckUtils]: 31: Hoare triple {1320#false} assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; {1320#false} is VALID [2020-07-29 03:08:15,572 INFO L280 TraceCheckUtils]: 32: Hoare triple {1320#false} stop_simulation_#res := stop_simulation_~__retres2~0; {1320#false} is VALID [2020-07-29 03:08:15,572 INFO L280 TraceCheckUtils]: 33: Hoare triple {1320#false} start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; {1320#false} is VALID [2020-07-29 03:08:15,573 INFO L280 TraceCheckUtils]: 34: Hoare triple {1320#false} assume !(0 != start_simulation_~tmp___0~2); {1320#false} is VALID [2020-07-29 03:08:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:15,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628777280] [2020-07-29 03:08:15,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:15,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:08:15,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627115243] [2020-07-29 03:08:15,578 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:08:15,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:15,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:08:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:08:15,579 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. cyclomatic complexity: 84 Second operand 3 states. [2020-07-29 03:08:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:15,883 INFO L93 Difference]: Finished difference Result 338 states and 473 transitions. [2020-07-29 03:08:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:08:15,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:08:15,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:15,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 473 transitions. [2020-07-29 03:08:15,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2020-07-29 03:08:15,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 473 transitions. [2020-07-29 03:08:15,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2020-07-29 03:08:15,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2020-07-29 03:08:15,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 473 transitions. [2020-07-29 03:08:15,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:15,938 INFO L688 BuchiCegarLoop]: Abstraction has 338 states and 473 transitions. [2020-07-29 03:08:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 473 transitions. [2020-07-29 03:08:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 322. [2020-07-29 03:08:15,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:15,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states and 473 transitions. Second operand 322 states. [2020-07-29 03:08:15,947 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states and 473 transitions. Second operand 322 states. [2020-07-29 03:08:15,947 INFO L87 Difference]: Start difference. First operand 338 states and 473 transitions. Second operand 322 states. [2020-07-29 03:08:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:15,962 INFO L93 Difference]: Finished difference Result 338 states and 473 transitions. [2020-07-29 03:08:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 473 transitions. [2020-07-29 03:08:15,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:15,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:15,963 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand 338 states and 473 transitions. [2020-07-29 03:08:15,963 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 338 states and 473 transitions. [2020-07-29 03:08:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:15,978 INFO L93 Difference]: Finished difference Result 338 states and 473 transitions. [2020-07-29 03:08:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 473 transitions. [2020-07-29 03:08:15,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:15,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:15,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:15,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-07-29 03:08:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 453 transitions. [2020-07-29 03:08:15,992 INFO L711 BuchiCegarLoop]: Abstraction has 322 states and 453 transitions. [2020-07-29 03:08:15,993 INFO L591 BuchiCegarLoop]: Abstraction has 322 states and 453 transitions. [2020-07-29 03:08:15,993 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:08:15,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states and 453 transitions. [2020-07-29 03:08:15,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2020-07-29 03:08:15,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:15,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:15,997 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:15,997 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, 1, 1] [2020-07-29 03:08:15,997 INFO L794 eck$LassoCheckResult]: Stem: 1769#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1682#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1683#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1666#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1667#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1755#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1761#L107 assume !(1 == ~P_1_pc~0); 1765#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1766#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1744#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1706#L373 assume !(0 != activate_threads_~tmp~1); 1685#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1686#L189 assume !(1 == ~C_1_pc~0); 1778#L189-2 assume !(2 == ~C_1_pc~0); 1713#L199-1 is_C_1_triggered_~__retres1~1 := 0; 1714#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1718#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1708#L381 assume !(0 != activate_threads_~tmp___1~1); 1709#L435-1 [2020-07-29 03:08:15,998 INFO L796 eck$LassoCheckResult]: Loop: 1709#L435-1 assume !false; 1913#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1910#L294 assume !false; 1908#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1904#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1902#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1900#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1897#L274 assume !(0 != eval_~tmp___2~0); 1898#L310 start_simulation_~kernel_st~0 := 2; 1664#L219-1 start_simulation_~kernel_st~0 := 3; 1665#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1678#L107-3 assume !(1 == ~P_1_pc~0); 1762#L107-5 is_P_1_triggered_~__retres1~0 := 0; 1837#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1831#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1832#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1855#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1853#L189-3 assume !(1 == ~C_1_pc~0); 1851#L189-5 assume !(2 == ~C_1_pc~0); 1849#L199-3 is_C_1_triggered_~__retres1~1 := 0; 1847#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1845#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1843#L381-3 assume !(0 != activate_threads_~tmp___1~1); 1842#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1782#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1721#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1722#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1770#L454 assume !(0 == start_simulation_~tmp~3); 1771#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1931#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1930#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1929#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 1927#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1925#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 1923#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 1921#L467 assume !(0 != start_simulation_~tmp___0~2); 1709#L435-1 [2020-07-29 03:08:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 1 times [2020-07-29 03:08:15,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:15,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469088089] [2020-07-29 03:08:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:16,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:16,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:16,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1124188166, now seen corresponding path program 1 times [2020-07-29 03:08:16,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:16,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915389403] [2020-07-29 03:08:16,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:16,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {2665#true} assume !false; {2665#true} is VALID [2020-07-29 03:08:16,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {2665#true} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {2665#true} is VALID [2020-07-29 03:08:16,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {2665#true} assume !false; {2665#true} is VALID [2020-07-29 03:08:16,104 INFO L280 TraceCheckUtils]: 3: Hoare triple {2665#true} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {2665#true} is VALID [2020-07-29 03:08:16,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {2665#true} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {2667#(<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)} is VALID [2020-07-29 03:08:16,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {2667#(<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {2668#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res|)} is VALID [2020-07-29 03:08:16,106 INFO L280 TraceCheckUtils]: 6: Hoare triple {2668#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res|)} eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; {2669#(<= 1 ULTIMATE.start_eval_~tmp___2~0)} is VALID [2020-07-29 03:08:16,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {2669#(<= 1 ULTIMATE.start_eval_~tmp___2~0)} assume !(0 != eval_~tmp___2~0); {2666#false} is VALID [2020-07-29 03:08:16,107 INFO L280 TraceCheckUtils]: 8: Hoare triple {2666#false} start_simulation_~kernel_st~0 := 2; {2666#false} is VALID [2020-07-29 03:08:16,108 INFO L280 TraceCheckUtils]: 9: Hoare triple {2666#false} start_simulation_~kernel_st~0 := 3; {2666#false} is VALID [2020-07-29 03:08:16,108 INFO L280 TraceCheckUtils]: 10: Hoare triple {2666#false} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {2666#false} is VALID [2020-07-29 03:08:16,108 INFO L280 TraceCheckUtils]: 11: Hoare triple {2666#false} assume !(1 == ~P_1_pc~0); {2666#false} is VALID [2020-07-29 03:08:16,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {2666#false} is_P_1_triggered_~__retres1~0 := 0; {2666#false} is VALID [2020-07-29 03:08:16,109 INFO L280 TraceCheckUtils]: 13: Hoare triple {2666#false} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {2666#false} is VALID [2020-07-29 03:08:16,109 INFO L280 TraceCheckUtils]: 14: Hoare triple {2666#false} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {2666#false} is VALID [2020-07-29 03:08:16,109 INFO L280 TraceCheckUtils]: 15: Hoare triple {2666#false} assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; {2666#false} is VALID [2020-07-29 03:08:16,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {2666#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {2666#false} is VALID [2020-07-29 03:08:16,110 INFO L280 TraceCheckUtils]: 17: Hoare triple {2666#false} assume !(1 == ~C_1_pc~0); {2666#false} is VALID [2020-07-29 03:08:16,110 INFO L280 TraceCheckUtils]: 18: Hoare triple {2666#false} assume !(2 == ~C_1_pc~0); {2666#false} is VALID [2020-07-29 03:08:16,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {2666#false} is_C_1_triggered_~__retres1~1 := 0; {2666#false} is VALID [2020-07-29 03:08:16,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {2666#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {2666#false} is VALID [2020-07-29 03:08:16,111 INFO L280 TraceCheckUtils]: 21: Hoare triple {2666#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {2666#false} is VALID [2020-07-29 03:08:16,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {2666#false} assume !(0 != activate_threads_~tmp___1~1); {2666#false} is VALID [2020-07-29 03:08:16,111 INFO L280 TraceCheckUtils]: 23: Hoare triple {2666#false} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {2666#false} is VALID [2020-07-29 03:08:16,111 INFO L280 TraceCheckUtils]: 24: Hoare triple {2666#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {2666#false} is VALID [2020-07-29 03:08:16,112 INFO L280 TraceCheckUtils]: 25: Hoare triple {2666#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {2666#false} is VALID [2020-07-29 03:08:16,112 INFO L280 TraceCheckUtils]: 26: Hoare triple {2666#false} start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; {2666#false} is VALID [2020-07-29 03:08:16,112 INFO L280 TraceCheckUtils]: 27: Hoare triple {2666#false} assume !(0 == start_simulation_~tmp~3); {2666#false} is VALID [2020-07-29 03:08:16,112 INFO L280 TraceCheckUtils]: 28: Hoare triple {2666#false} havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {2666#false} is VALID [2020-07-29 03:08:16,113 INFO L280 TraceCheckUtils]: 29: Hoare triple {2666#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {2666#false} is VALID [2020-07-29 03:08:16,113 INFO L280 TraceCheckUtils]: 30: Hoare triple {2666#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {2666#false} is VALID [2020-07-29 03:08:16,113 INFO L280 TraceCheckUtils]: 31: Hoare triple {2666#false} stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; {2666#false} is VALID [2020-07-29 03:08:16,113 INFO L280 TraceCheckUtils]: 32: Hoare triple {2666#false} assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; {2666#false} is VALID [2020-07-29 03:08:16,114 INFO L280 TraceCheckUtils]: 33: Hoare triple {2666#false} stop_simulation_#res := stop_simulation_~__retres2~0; {2666#false} is VALID [2020-07-29 03:08:16,114 INFO L280 TraceCheckUtils]: 34: Hoare triple {2666#false} start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; {2666#false} is VALID [2020-07-29 03:08:16,114 INFO L280 TraceCheckUtils]: 35: Hoare triple {2666#false} assume !(0 != start_simulation_~tmp___0~2); {2666#false} is VALID [2020-07-29 03:08:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:16,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915389403] [2020-07-29 03:08:16,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:16,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:08:16,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734995989] [2020-07-29 03:08:16,118 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:08:16,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:08:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:08:16,119 INFO L87 Difference]: Start difference. First operand 322 states and 453 transitions. cyclomatic complexity: 132 Second operand 5 states. [2020-07-29 03:08:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:16,753 INFO L93 Difference]: Finished difference Result 564 states and 783 transitions. [2020-07-29 03:08:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:08:16,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:08:16,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:16,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 564 states and 783 transitions. [2020-07-29 03:08:16,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 546 [2020-07-29 03:08:16,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 564 states to 564 states and 783 transitions. [2020-07-29 03:08:16,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2020-07-29 03:08:16,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 564 [2020-07-29 03:08:16,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 783 transitions. [2020-07-29 03:08:16,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:16,884 INFO L688 BuchiCegarLoop]: Abstraction has 564 states and 783 transitions. [2020-07-29 03:08:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 783 transitions. [2020-07-29 03:08:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 334. [2020-07-29 03:08:16,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:16,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states and 783 transitions. Second operand 334 states. [2020-07-29 03:08:16,893 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states and 783 transitions. Second operand 334 states. [2020-07-29 03:08:16,893 INFO L87 Difference]: Start difference. First operand 564 states and 783 transitions. Second operand 334 states. [2020-07-29 03:08:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:16,913 INFO L93 Difference]: Finished difference Result 564 states and 783 transitions. [2020-07-29 03:08:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 783 transitions. [2020-07-29 03:08:16,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:16,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:16,915 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 564 states and 783 transitions. [2020-07-29 03:08:16,915 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 564 states and 783 transitions. [2020-07-29 03:08:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:16,935 INFO L93 Difference]: Finished difference Result 564 states and 783 transitions. [2020-07-29 03:08:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 783 transitions. [2020-07-29 03:08:16,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:16,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:16,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:16,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-07-29 03:08:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2020-07-29 03:08:16,946 INFO L711 BuchiCegarLoop]: Abstraction has 334 states and 465 transitions. [2020-07-29 03:08:16,946 INFO L591 BuchiCegarLoop]: Abstraction has 334 states and 465 transitions. [2020-07-29 03:08:16,946 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:08:16,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 465 transitions. [2020-07-29 03:08:16,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 316 [2020-07-29 03:08:16,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:16,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:16,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:16,950 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, 1, 1, 1] [2020-07-29 03:08:16,950 INFO L794 eck$LassoCheckResult]: Stem: 3355#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3261#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3262#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3246#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3247#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3340#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3348#L107 assume !(1 == ~P_1_pc~0); 3351#L107-2 is_P_1_triggered_~__retres1~0 := 0; 3352#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3329#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3287#L373 assume !(0 != activate_threads_~tmp~1); 3264#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3265#L189 assume !(1 == ~C_1_pc~0); 3366#L189-2 assume !(2 == ~C_1_pc~0); 3295#L199-1 is_C_1_triggered_~__retres1~1 := 0; 3296#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3300#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3289#L381 assume !(0 != activate_threads_~tmp___1~1); 3290#L435-1 [2020-07-29 03:08:16,951 INFO L796 eck$LassoCheckResult]: Loop: 3290#L435-1 assume !false; 3563#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3309#L294 assume !false; 3424#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3423#L244 assume !(0 == ~P_1_st~0); 3420#L248 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3418#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3417#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3408#L274 assume !(0 != eval_~tmp___2~0); 3410#L310 start_simulation_~kernel_st~0 := 2; 3415#L219-1 start_simulation_~kernel_st~0 := 3; 3256#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3257#L107-3 assume !(1 == ~P_1_pc~0); 3404#L107-5 is_P_1_triggered_~__retres1~0 := 0; 3405#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3395#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3396#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 3387#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3388#L189-3 assume !(1 == ~C_1_pc~0); 3376#L189-5 assume !(2 == ~C_1_pc~0); 3311#L199-3 is_C_1_triggered_~__retres1~1 := 0; 3312#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3372#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3373#L381-3 assume !(0 != activate_threads_~tmp___1~1); 3277#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3278#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3303#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3304#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 3356#L454 assume !(0 == start_simulation_~tmp~3); 3358#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3359#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3569#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3568#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 3567#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3566#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 3565#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 3564#L467 assume !(0 != start_simulation_~tmp___0~2); 3290#L435-1 [2020-07-29 03:08:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 2 times [2020-07-29 03:08:16,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:16,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402796206] [2020-07-29 03:08:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:16,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:16,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:16,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -409531438, now seen corresponding path program 1 times [2020-07-29 03:08:16,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:16,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744216392] [2020-07-29 03:08:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:17,075 INFO L280 TraceCheckUtils]: 0: Hoare triple {4709#true} assume !false; {4709#true} is VALID [2020-07-29 03:08:17,075 INFO L280 TraceCheckUtils]: 1: Hoare triple {4709#true} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {4709#true} is VALID [2020-07-29 03:08:17,076 INFO L280 TraceCheckUtils]: 2: Hoare triple {4709#true} assume !false; {4709#true} is VALID [2020-07-29 03:08:17,076 INFO L280 TraceCheckUtils]: 3: Hoare triple {4709#true} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {4709#true} is VALID [2020-07-29 03:08:17,076 INFO L280 TraceCheckUtils]: 4: Hoare triple {4709#true} assume !(0 == ~P_1_st~0); {4709#true} is VALID [2020-07-29 03:08:17,076 INFO L280 TraceCheckUtils]: 5: Hoare triple {4709#true} assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; {4709#true} is VALID [2020-07-29 03:08:17,077 INFO L280 TraceCheckUtils]: 6: Hoare triple {4709#true} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {4709#true} is VALID [2020-07-29 03:08:17,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {4709#true} eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; {4709#true} is VALID [2020-07-29 03:08:17,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {4709#true} assume !(0 != eval_~tmp___2~0); {4709#true} is VALID [2020-07-29 03:08:17,077 INFO L280 TraceCheckUtils]: 9: Hoare triple {4709#true} start_simulation_~kernel_st~0 := 2; {4709#true} is VALID [2020-07-29 03:08:17,077 INFO L280 TraceCheckUtils]: 10: Hoare triple {4709#true} start_simulation_~kernel_st~0 := 3; {4709#true} is VALID [2020-07-29 03:08:17,078 INFO L280 TraceCheckUtils]: 11: Hoare triple {4709#true} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {4709#true} is VALID [2020-07-29 03:08:17,078 INFO L280 TraceCheckUtils]: 12: Hoare triple {4709#true} assume !(1 == ~P_1_pc~0); {4709#true} is VALID [2020-07-29 03:08:17,079 INFO L280 TraceCheckUtils]: 13: Hoare triple {4709#true} is_P_1_triggered_~__retres1~0 := 0; {4711#(and (<= 0 ULTIMATE.start_is_P_1_triggered_~__retres1~0) (<= ULTIMATE.start_is_P_1_triggered_~__retres1~0 0))} is VALID [2020-07-29 03:08:17,080 INFO L280 TraceCheckUtils]: 14: Hoare triple {4711#(and (<= 0 ULTIMATE.start_is_P_1_triggered_~__retres1~0) (<= ULTIMATE.start_is_P_1_triggered_~__retres1~0 0))} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {4712#(and (<= 0 |ULTIMATE.start_is_P_1_triggered_#res|) (<= |ULTIMATE.start_is_P_1_triggered_#res| 0))} is VALID [2020-07-29 03:08:17,082 INFO L280 TraceCheckUtils]: 15: Hoare triple {4712#(and (<= 0 |ULTIMATE.start_is_P_1_triggered_#res|) (<= |ULTIMATE.start_is_P_1_triggered_#res| 0))} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {4713#(and (<= 0 ULTIMATE.start_activate_threads_~tmp~1) (<= ULTIMATE.start_activate_threads_~tmp~1 0))} is VALID [2020-07-29 03:08:17,083 INFO L280 TraceCheckUtils]: 16: Hoare triple {4713#(and (<= 0 ULTIMATE.start_activate_threads_~tmp~1) (<= ULTIMATE.start_activate_threads_~tmp~1 0))} assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; {4710#false} is VALID [2020-07-29 03:08:17,083 INFO L280 TraceCheckUtils]: 17: Hoare triple {4710#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {4710#false} is VALID [2020-07-29 03:08:17,083 INFO L280 TraceCheckUtils]: 18: Hoare triple {4710#false} assume !(1 == ~C_1_pc~0); {4710#false} is VALID [2020-07-29 03:08:17,084 INFO L280 TraceCheckUtils]: 19: Hoare triple {4710#false} assume !(2 == ~C_1_pc~0); {4710#false} is VALID [2020-07-29 03:08:17,084 INFO L280 TraceCheckUtils]: 20: Hoare triple {4710#false} is_C_1_triggered_~__retres1~1 := 0; {4710#false} is VALID [2020-07-29 03:08:17,084 INFO L280 TraceCheckUtils]: 21: Hoare triple {4710#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {4710#false} is VALID [2020-07-29 03:08:17,085 INFO L280 TraceCheckUtils]: 22: Hoare triple {4710#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {4710#false} is VALID [2020-07-29 03:08:17,085 INFO L280 TraceCheckUtils]: 23: Hoare triple {4710#false} assume !(0 != activate_threads_~tmp___1~1); {4710#false} is VALID [2020-07-29 03:08:17,085 INFO L280 TraceCheckUtils]: 24: Hoare triple {4710#false} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {4710#false} is VALID [2020-07-29 03:08:17,085 INFO L280 TraceCheckUtils]: 25: Hoare triple {4710#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {4710#false} is VALID [2020-07-29 03:08:17,085 INFO L280 TraceCheckUtils]: 26: Hoare triple {4710#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {4710#false} is VALID [2020-07-29 03:08:17,086 INFO L280 TraceCheckUtils]: 27: Hoare triple {4710#false} start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; {4710#false} is VALID [2020-07-29 03:08:17,086 INFO L280 TraceCheckUtils]: 28: Hoare triple {4710#false} assume !(0 == start_simulation_~tmp~3); {4710#false} is VALID [2020-07-29 03:08:17,086 INFO L280 TraceCheckUtils]: 29: Hoare triple {4710#false} havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {4710#false} is VALID [2020-07-29 03:08:17,086 INFO L280 TraceCheckUtils]: 30: Hoare triple {4710#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {4710#false} is VALID [2020-07-29 03:08:17,086 INFO L280 TraceCheckUtils]: 31: Hoare triple {4710#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {4710#false} is VALID [2020-07-29 03:08:17,087 INFO L280 TraceCheckUtils]: 32: Hoare triple {4710#false} stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; {4710#false} is VALID [2020-07-29 03:08:17,087 INFO L280 TraceCheckUtils]: 33: Hoare triple {4710#false} assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; {4710#false} is VALID [2020-07-29 03:08:17,087 INFO L280 TraceCheckUtils]: 34: Hoare triple {4710#false} stop_simulation_#res := stop_simulation_~__retres2~0; {4710#false} is VALID [2020-07-29 03:08:17,087 INFO L280 TraceCheckUtils]: 35: Hoare triple {4710#false} start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; {4710#false} is VALID [2020-07-29 03:08:17,088 INFO L280 TraceCheckUtils]: 36: Hoare triple {4710#false} assume !(0 != start_simulation_~tmp___0~2); {4710#false} is VALID [2020-07-29 03:08:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:17,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744216392] [2020-07-29 03:08:17,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:17,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:08:17,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277160769] [2020-07-29 03:08:17,092 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:08:17,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:08:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:08:17,093 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. cyclomatic complexity: 132 Second operand 5 states. [2020-07-29 03:08:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:17,922 INFO L93 Difference]: Finished difference Result 746 states and 1040 transitions. [2020-07-29 03:08:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:08:17,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:08:17,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:17,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 746 states and 1040 transitions. [2020-07-29 03:08:18,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 728 [2020-07-29 03:08:18,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 746 states to 746 states and 1040 transitions. [2020-07-29 03:08:18,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 746 [2020-07-29 03:08:18,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 746 [2020-07-29 03:08:18,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 746 states and 1040 transitions. [2020-07-29 03:08:18,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:18,057 INFO L688 BuchiCegarLoop]: Abstraction has 746 states and 1040 transitions. [2020-07-29 03:08:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states and 1040 transitions. [2020-07-29 03:08:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 346. [2020-07-29 03:08:18,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:18,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states and 1040 transitions. Second operand 346 states. [2020-07-29 03:08:18,066 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states and 1040 transitions. Second operand 346 states. [2020-07-29 03:08:18,066 INFO L87 Difference]: Start difference. First operand 746 states and 1040 transitions. Second operand 346 states. [2020-07-29 03:08:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:18,101 INFO L93 Difference]: Finished difference Result 746 states and 1040 transitions. [2020-07-29 03:08:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1040 transitions. [2020-07-29 03:08:18,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:18,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:18,103 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand 746 states and 1040 transitions. [2020-07-29 03:08:18,103 INFO L87 Difference]: Start difference. First operand 346 states. Second operand 746 states and 1040 transitions. [2020-07-29 03:08:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:18,139 INFO L93 Difference]: Finished difference Result 746 states and 1040 transitions. [2020-07-29 03:08:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1040 transitions. [2020-07-29 03:08:18,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:18,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:18,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:18,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-07-29 03:08:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 472 transitions. [2020-07-29 03:08:18,150 INFO L711 BuchiCegarLoop]: Abstraction has 346 states and 472 transitions. [2020-07-29 03:08:18,150 INFO L591 BuchiCegarLoop]: Abstraction has 346 states and 472 transitions. [2020-07-29 03:08:18,150 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:08:18,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 346 states and 472 transitions. [2020-07-29 03:08:18,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 328 [2020-07-29 03:08:18,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:18,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:18,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:18,153 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, 1, 1, 1] [2020-07-29 03:08:18,154 INFO L794 eck$LassoCheckResult]: Stem: 5575#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5483#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 5484#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5469#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5470#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5559#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5567#L107 assume !(1 == ~P_1_pc~0); 5572#L107-2 is_P_1_triggered_~__retres1~0 := 0; 5573#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5547#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5507#L373 assume !(0 != activate_threads_~tmp~1); 5486#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5487#L189 assume !(1 == ~C_1_pc~0); 5586#L189-2 assume !(2 == ~C_1_pc~0); 5515#L199-1 is_C_1_triggered_~__retres1~1 := 0; 5516#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5520#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5510#L381 assume !(0 != activate_threads_~tmp___1~1); 5511#L435-1 [2020-07-29 03:08:18,154 INFO L796 eck$LassoCheckResult]: Loop: 5511#L435-1 assume !false; 5674#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5670#L294 assume !false; 5668#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5666#L244 assume !(0 == ~P_1_st~0); 5662#L248 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 5660#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5656#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5647#L274 assume !(0 != eval_~tmp___2~0); 5645#L310 start_simulation_~kernel_st~0 := 2; 5643#L219-1 start_simulation_~kernel_st~0 := 3; 5635#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5569#L107-3 assume !(1 == ~P_1_pc~0); 5570#L107-5 is_P_1_triggered_~__retres1~0 := 0; 5642#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5641#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5640#L373-3 assume !(0 != activate_threads_~tmp~1); 5639#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5638#L189-3 assume !(1 == ~C_1_pc~0); 5636#L189-5 assume !(2 == ~C_1_pc~0); 5637#L199-3 is_C_1_triggered_~__retres1~1 := 0; 5622#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5623#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5618#L381-3 assume !(0 != activate_threads_~tmp___1~1); 5619#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5613#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5614#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5609#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 5610#L454 assume !(0 == start_simulation_~tmp~3); 5686#L454-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5684#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5683#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5682#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 5681#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5680#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 5679#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 5678#L467 assume !(0 != start_simulation_~tmp___0~2); 5511#L435-1 [2020-07-29 03:08:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:18,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 3 times [2020-07-29 03:08:18,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:18,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250091936] [2020-07-29 03:08:18,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:18,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:18,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:18,174 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash 13170388, now seen corresponding path program 1 times [2020-07-29 03:08:18,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:18,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544742949] [2020-07-29 03:08:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:18,210 INFO L280 TraceCheckUtils]: 0: Hoare triple {7308#true} assume !false; {7308#true} is VALID [2020-07-29 03:08:18,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {7308#true} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {7308#true} is VALID [2020-07-29 03:08:18,210 INFO L280 TraceCheckUtils]: 2: Hoare triple {7308#true} assume !false; {7308#true} is VALID [2020-07-29 03:08:18,211 INFO L280 TraceCheckUtils]: 3: Hoare triple {7308#true} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {7308#true} is VALID [2020-07-29 03:08:18,211 INFO L280 TraceCheckUtils]: 4: Hoare triple {7308#true} assume !(0 == ~P_1_st~0); {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,212 INFO L280 TraceCheckUtils]: 6: Hoare triple {7310#(not (= 0 ~P_1_st~0))} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,213 INFO L280 TraceCheckUtils]: 7: Hoare triple {7310#(not (= 0 ~P_1_st~0))} eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,213 INFO L280 TraceCheckUtils]: 8: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume !(0 != eval_~tmp___2~0); {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,214 INFO L280 TraceCheckUtils]: 9: Hoare triple {7310#(not (= 0 ~P_1_st~0))} start_simulation_~kernel_st~0 := 2; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,215 INFO L280 TraceCheckUtils]: 10: Hoare triple {7310#(not (= 0 ~P_1_st~0))} start_simulation_~kernel_st~0 := 3; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,215 INFO L280 TraceCheckUtils]: 11: Hoare triple {7310#(not (= 0 ~P_1_st~0))} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,216 INFO L280 TraceCheckUtils]: 12: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume !(1 == ~P_1_pc~0); {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,216 INFO L280 TraceCheckUtils]: 13: Hoare triple {7310#(not (= 0 ~P_1_st~0))} is_P_1_triggered_~__retres1~0 := 0; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,217 INFO L280 TraceCheckUtils]: 14: Hoare triple {7310#(not (= 0 ~P_1_st~0))} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,218 INFO L280 TraceCheckUtils]: 15: Hoare triple {7310#(not (= 0 ~P_1_st~0))} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,219 INFO L280 TraceCheckUtils]: 16: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume !(0 != activate_threads_~tmp~1); {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,219 INFO L280 TraceCheckUtils]: 17: Hoare triple {7310#(not (= 0 ~P_1_st~0))} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,220 INFO L280 TraceCheckUtils]: 18: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume !(1 == ~C_1_pc~0); {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,220 INFO L280 TraceCheckUtils]: 19: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume !(2 == ~C_1_pc~0); {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,221 INFO L280 TraceCheckUtils]: 20: Hoare triple {7310#(not (= 0 ~P_1_st~0))} is_C_1_triggered_~__retres1~1 := 0; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,222 INFO L280 TraceCheckUtils]: 21: Hoare triple {7310#(not (= 0 ~P_1_st~0))} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,222 INFO L280 TraceCheckUtils]: 22: Hoare triple {7310#(not (= 0 ~P_1_st~0))} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,223 INFO L280 TraceCheckUtils]: 23: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume !(0 != activate_threads_~tmp___1~1); {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,223 INFO L280 TraceCheckUtils]: 24: Hoare triple {7310#(not (= 0 ~P_1_st~0))} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {7310#(not (= 0 ~P_1_st~0))} is VALID [2020-07-29 03:08:18,224 INFO L280 TraceCheckUtils]: 25: Hoare triple {7310#(not (= 0 ~P_1_st~0))} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {7309#false} is VALID [2020-07-29 03:08:18,224 INFO L280 TraceCheckUtils]: 26: Hoare triple {7309#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {7309#false} is VALID [2020-07-29 03:08:18,225 INFO L280 TraceCheckUtils]: 27: Hoare triple {7309#false} start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; {7309#false} is VALID [2020-07-29 03:08:18,225 INFO L280 TraceCheckUtils]: 28: Hoare triple {7309#false} assume !(0 == start_simulation_~tmp~3); {7309#false} is VALID [2020-07-29 03:08:18,226 INFO L280 TraceCheckUtils]: 29: Hoare triple {7309#false} havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {7309#false} is VALID [2020-07-29 03:08:18,226 INFO L280 TraceCheckUtils]: 30: Hoare triple {7309#false} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {7309#false} is VALID [2020-07-29 03:08:18,226 INFO L280 TraceCheckUtils]: 31: Hoare triple {7309#false} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {7309#false} is VALID [2020-07-29 03:08:18,226 INFO L280 TraceCheckUtils]: 32: Hoare triple {7309#false} stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; {7309#false} is VALID [2020-07-29 03:08:18,227 INFO L280 TraceCheckUtils]: 33: Hoare triple {7309#false} assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; {7309#false} is VALID [2020-07-29 03:08:18,227 INFO L280 TraceCheckUtils]: 34: Hoare triple {7309#false} stop_simulation_#res := stop_simulation_~__retres2~0; {7309#false} is VALID [2020-07-29 03:08:18,227 INFO L280 TraceCheckUtils]: 35: Hoare triple {7309#false} start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; {7309#false} is VALID [2020-07-29 03:08:18,227 INFO L280 TraceCheckUtils]: 36: Hoare triple {7309#false} assume !(0 != start_simulation_~tmp___0~2); {7309#false} is VALID [2020-07-29 03:08:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:18,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544742949] [2020-07-29 03:08:18,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:18,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:08:18,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385405641] [2020-07-29 03:08:18,234 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:08:18,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:08:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:08:18,235 INFO L87 Difference]: Start difference. First operand 346 states and 472 transitions. cyclomatic complexity: 127 Second operand 3 states. [2020-07-29 03:08:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:18,455 INFO L93 Difference]: Finished difference Result 506 states and 678 transitions. [2020-07-29 03:08:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:08:18,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:08:18,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:18,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 678 transitions. [2020-07-29 03:08:18,513 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2020-07-29 03:08:18,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 506 states and 678 transitions. [2020-07-29 03:08:18,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2020-07-29 03:08:18,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2020-07-29 03:08:18,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 678 transitions. [2020-07-29 03:08:18,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:18,531 INFO L688 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2020-07-29 03:08:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 678 transitions. [2020-07-29 03:08:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2020-07-29 03:08:18,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:18,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states and 678 transitions. Second operand 506 states. [2020-07-29 03:08:18,541 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states and 678 transitions. Second operand 506 states. [2020-07-29 03:08:18,541 INFO L87 Difference]: Start difference. First operand 506 states and 678 transitions. Second operand 506 states. [2020-07-29 03:08:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:18,558 INFO L93 Difference]: Finished difference Result 506 states and 678 transitions. [2020-07-29 03:08:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 678 transitions. [2020-07-29 03:08:18,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:18,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:18,559 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 506 states and 678 transitions. [2020-07-29 03:08:18,560 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 506 states and 678 transitions. [2020-07-29 03:08:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:18,583 INFO L93 Difference]: Finished difference Result 506 states and 678 transitions. [2020-07-29 03:08:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 678 transitions. [2020-07-29 03:08:18,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:18,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:18,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:18,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-07-29 03:08:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 678 transitions. [2020-07-29 03:08:18,604 INFO L711 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2020-07-29 03:08:18,604 INFO L591 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2020-07-29 03:08:18,604 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:08:18,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 506 states and 678 transitions. [2020-07-29 03:08:18,607 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2020-07-29 03:08:18,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:18,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:18,608 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:18,609 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:18,609 INFO L794 eck$LassoCheckResult]: Stem: 7931#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7836#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 7837#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 7821#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 7822#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 7915#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 7924#L107 assume !(1 == ~P_1_pc~0); 7927#L107-2 is_P_1_triggered_~__retres1~0 := 0; 7928#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 7903#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7862#L373 assume !(0 != activate_threads_~tmp~1); 7840#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 7841#L189 assume !(1 == ~C_1_pc~0); 7941#L189-2 assume !(2 == ~C_1_pc~0); 7870#L199-1 is_C_1_triggered_~__retres1~1 := 0; 7871#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 7875#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7865#L381 assume !(0 != activate_threads_~tmp___1~1); 7866#L435-1 assume !false; 8153#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 8151#L294 [2020-07-29 03:08:18,609 INFO L796 eck$LassoCheckResult]: Loop: 8151#L294 assume !false; 8146#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8143#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 8141#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8139#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8137#L274 assume 0 != eval_~tmp___2~0; 8134#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 8132#L283 assume !(0 != eval_~tmp~0); 8133#L279 assume !(0 == ~C_1_st~0); 8151#L294 [2020-07-29 03:08:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 1 times [2020-07-29 03:08:18,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:18,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184686779] [2020-07-29 03:08:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:18,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:18,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:18,667 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1487904191, now seen corresponding path program 1 times [2020-07-29 03:08:18,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:18,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941122747] [2020-07-29 03:08:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:18,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:18,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:18,685 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 489258489, now seen corresponding path program 1 times [2020-07-29 03:08:18,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:18,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467303633] [2020-07-29 03:08:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:18,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {9342#true} ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; {9342#true} is VALID [2020-07-29 03:08:18,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {9342#true} havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; {9342#true} is VALID [2020-07-29 03:08:18,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {9342#true} havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; {9342#true} is VALID [2020-07-29 03:08:18,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {9342#true} assume 1 == ~P_1_i~0;~P_1_st~0 := 0; {9342#true} is VALID [2020-07-29 03:08:18,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {9342#true} assume 1 == ~C_1_i~0;~C_1_st~0 := 0; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,749 INFO L280 TraceCheckUtils]: 5: Hoare triple {9344#(= 0 ~C_1_st~0)} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !(1 == ~P_1_pc~0); {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {9344#(= 0 ~C_1_st~0)} is_P_1_triggered_~__retres1~0 := 0; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {9344#(= 0 ~C_1_st~0)} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {9344#(= 0 ~C_1_st~0)} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,752 INFO L280 TraceCheckUtils]: 10: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !(0 != activate_threads_~tmp~1); {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {9344#(= 0 ~C_1_st~0)} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !(1 == ~C_1_pc~0); {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !(2 == ~C_1_pc~0); {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,755 INFO L280 TraceCheckUtils]: 14: Hoare triple {9344#(= 0 ~C_1_st~0)} is_C_1_triggered_~__retres1~1 := 0; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,755 INFO L280 TraceCheckUtils]: 15: Hoare triple {9344#(= 0 ~C_1_st~0)} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {9344#(= 0 ~C_1_st~0)} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !(0 != activate_threads_~tmp___1~1); {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,757 INFO L280 TraceCheckUtils]: 18: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !false; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {9344#(= 0 ~C_1_st~0)} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,758 INFO L280 TraceCheckUtils]: 20: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !false; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {9344#(= 0 ~C_1_st~0)} havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,759 INFO L280 TraceCheckUtils]: 22: Hoare triple {9344#(= 0 ~C_1_st~0)} assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,760 INFO L280 TraceCheckUtils]: 23: Hoare triple {9344#(= 0 ~C_1_st~0)} exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,760 INFO L280 TraceCheckUtils]: 24: Hoare triple {9344#(= 0 ~C_1_st~0)} eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,761 INFO L280 TraceCheckUtils]: 25: Hoare triple {9344#(= 0 ~C_1_st~0)} assume 0 != eval_~tmp___2~0; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,761 INFO L280 TraceCheckUtils]: 26: Hoare triple {9344#(= 0 ~C_1_st~0)} assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,762 INFO L280 TraceCheckUtils]: 27: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !(0 != eval_~tmp~0); {9344#(= 0 ~C_1_st~0)} is VALID [2020-07-29 03:08:18,762 INFO L280 TraceCheckUtils]: 28: Hoare triple {9344#(= 0 ~C_1_st~0)} assume !(0 == ~C_1_st~0); {9343#false} is VALID [2020-07-29 03:08:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:18,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467303633] [2020-07-29 03:08:18,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:18,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:08:18,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203276293] [2020-07-29 03:08:18,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:18,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:08:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:08:18,834 INFO L87 Difference]: Start difference. First operand 506 states and 678 transitions. cyclomatic complexity: 175 Second operand 3 states. [2020-07-29 03:08:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:19,387 INFO L93 Difference]: Finished difference Result 815 states and 1070 transitions. [2020-07-29 03:08:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:08:19,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:08:19,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:19,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 815 states and 1070 transitions. [2020-07-29 03:08:19,490 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2020-07-29 03:08:19,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 815 states to 815 states and 1070 transitions. [2020-07-29 03:08:19,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 815 [2020-07-29 03:08:19,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 815 [2020-07-29 03:08:19,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 815 states and 1070 transitions. [2020-07-29 03:08:19,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:19,551 INFO L688 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2020-07-29 03:08:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 1070 transitions. [2020-07-29 03:08:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2020-07-29 03:08:19,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:19,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 815 states and 1070 transitions. Second operand 815 states. [2020-07-29 03:08:19,571 INFO L74 IsIncluded]: Start isIncluded. First operand 815 states and 1070 transitions. Second operand 815 states. [2020-07-29 03:08:19,571 INFO L87 Difference]: Start difference. First operand 815 states and 1070 transitions. Second operand 815 states. [2020-07-29 03:08:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:19,626 INFO L93 Difference]: Finished difference Result 815 states and 1070 transitions. [2020-07-29 03:08:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1070 transitions. [2020-07-29 03:08:19,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:19,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:19,629 INFO L74 IsIncluded]: Start isIncluded. First operand 815 states. Second operand 815 states and 1070 transitions. [2020-07-29 03:08:19,629 INFO L87 Difference]: Start difference. First operand 815 states. Second operand 815 states and 1070 transitions. [2020-07-29 03:08:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:19,677 INFO L93 Difference]: Finished difference Result 815 states and 1070 transitions. [2020-07-29 03:08:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1070 transitions. [2020-07-29 03:08:19,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:19,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:19,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:19,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2020-07-29 03:08:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1070 transitions. [2020-07-29 03:08:19,729 INFO L711 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2020-07-29 03:08:19,729 INFO L591 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2020-07-29 03:08:19,729 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:08:19,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 815 states and 1070 transitions. [2020-07-29 03:08:19,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2020-07-29 03:08:19,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:19,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:19,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:19,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:19,738 INFO L794 eck$LassoCheckResult]: Stem: 10279#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 10178#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 10179#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 10164#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 10165#L226-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 10263#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 10828#L107 assume !(1 == ~P_1_pc~0); 10827#L107-2 is_P_1_triggered_~__retres1~0 := 0; 10826#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 10825#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10824#L373 assume !(0 != activate_threads_~tmp~1); 10823#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 10822#L189 assume !(1 == ~C_1_pc~0); 10821#L189-2 assume !(2 == ~C_1_pc~0); 10216#L199-1 is_C_1_triggered_~__retres1~1 := 0; 10217#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 10221#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 10208#L381 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 10209#L435-1 assume !false; 10788#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 10708#L294 [2020-07-29 03:08:19,738 INFO L796 eck$LassoCheckResult]: Loop: 10708#L294 assume !false; 10786#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10818#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 10774#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10773#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 10772#L274 assume 0 != eval_~tmp___2~0; 10771#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 10770#L283 assume !(0 != eval_~tmp~0); 10710#L279 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 10707#L298 assume !(0 != eval_~tmp___1~0); 10708#L294 [2020-07-29 03:08:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:19,739 INFO L82 PathProgramCache]: Analyzing trace with hash -757871933, now seen corresponding path program 1 times [2020-07-29 03:08:19,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:19,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431089390] [2020-07-29 03:08:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:08:19,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {12608#true} ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; {12608#true} is VALID [2020-07-29 03:08:19,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {12608#true} havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; {12610#(= 1 ~C_1_i~0)} is VALID [2020-07-29 03:08:19,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {12610#(= 1 ~C_1_i~0)} havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; {12610#(= 1 ~C_1_i~0)} is VALID [2020-07-29 03:08:19,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {12610#(= 1 ~C_1_i~0)} assume 1 == ~P_1_i~0;~P_1_st~0 := 0; {12610#(= 1 ~C_1_i~0)} is VALID [2020-07-29 03:08:19,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {12610#(= 1 ~C_1_i~0)} assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; {12609#false} is VALID [2020-07-29 03:08:19,780 INFO L280 TraceCheckUtils]: 5: Hoare triple {12609#false} havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; {12609#false} is VALID [2020-07-29 03:08:19,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {12609#false} assume !(1 == ~P_1_pc~0); {12609#false} is VALID [2020-07-29 03:08:19,781 INFO L280 TraceCheckUtils]: 7: Hoare triple {12609#false} is_P_1_triggered_~__retres1~0 := 0; {12609#false} is VALID [2020-07-29 03:08:19,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {12609#false} is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; {12609#false} is VALID [2020-07-29 03:08:19,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {12609#false} activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; {12609#false} is VALID [2020-07-29 03:08:19,782 INFO L280 TraceCheckUtils]: 10: Hoare triple {12609#false} assume !(0 != activate_threads_~tmp~1); {12609#false} is VALID [2020-07-29 03:08:19,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {12609#false} havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; {12609#false} is VALID [2020-07-29 03:08:19,782 INFO L280 TraceCheckUtils]: 12: Hoare triple {12609#false} assume !(1 == ~C_1_pc~0); {12609#false} is VALID [2020-07-29 03:08:19,782 INFO L280 TraceCheckUtils]: 13: Hoare triple {12609#false} assume !(2 == ~C_1_pc~0); {12609#false} is VALID [2020-07-29 03:08:19,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {12609#false} is_C_1_triggered_~__retres1~1 := 0; {12609#false} is VALID [2020-07-29 03:08:19,783 INFO L280 TraceCheckUtils]: 15: Hoare triple {12609#false} is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; {12609#false} is VALID [2020-07-29 03:08:19,783 INFO L280 TraceCheckUtils]: 16: Hoare triple {12609#false} activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; {12609#false} is VALID [2020-07-29 03:08:19,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {12609#false} assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; {12609#false} is VALID [2020-07-29 03:08:19,784 INFO L280 TraceCheckUtils]: 18: Hoare triple {12609#false} assume !false; {12609#false} is VALID [2020-07-29 03:08:19,784 INFO L280 TraceCheckUtils]: 19: Hoare triple {12609#false} start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; {12609#false} is VALID [2020-07-29 03:08:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:08:19,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431089390] [2020-07-29 03:08:19,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:08:19,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:08:19,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468783961] [2020-07-29 03:08:19,790 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:08:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 1 times [2020-07-29 03:08:19,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:19,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975413033] [2020-07-29 03:08:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:19,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:19,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:19,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:19,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:08:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:08:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:08:19,898 INFO L87 Difference]: Start difference. First operand 815 states and 1070 transitions. cyclomatic complexity: 258 Second operand 3 states. [2020-07-29 03:08:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:20,065 INFO L93 Difference]: Finished difference Result 800 states and 1053 transitions. [2020-07-29 03:08:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:08:20,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:08:20,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:08:20,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 800 states and 1053 transitions. [2020-07-29 03:08:20,132 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2020-07-29 03:08:20,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 800 states to 800 states and 1053 transitions. [2020-07-29 03:08:20,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 800 [2020-07-29 03:08:20,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 800 [2020-07-29 03:08:20,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 800 states and 1053 transitions. [2020-07-29 03:08:20,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:08:20,186 INFO L688 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2020-07-29 03:08:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states and 1053 transitions. [2020-07-29 03:08:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2020-07-29 03:08:20,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:08:20,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 800 states and 1053 transitions. Second operand 800 states. [2020-07-29 03:08:20,201 INFO L74 IsIncluded]: Start isIncluded. First operand 800 states and 1053 transitions. Second operand 800 states. [2020-07-29 03:08:20,201 INFO L87 Difference]: Start difference. First operand 800 states and 1053 transitions. Second operand 800 states. [2020-07-29 03:08:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:20,248 INFO L93 Difference]: Finished difference Result 800 states and 1053 transitions. [2020-07-29 03:08:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1053 transitions. [2020-07-29 03:08:20,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:20,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:20,251 INFO L74 IsIncluded]: Start isIncluded. First operand 800 states. Second operand 800 states and 1053 transitions. [2020-07-29 03:08:20,251 INFO L87 Difference]: Start difference. First operand 800 states. Second operand 800 states and 1053 transitions. [2020-07-29 03:08:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:08:20,294 INFO L93 Difference]: Finished difference Result 800 states and 1053 transitions. [2020-07-29 03:08:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1053 transitions. [2020-07-29 03:08:20,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:08:20,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:08:20,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:08:20,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:08:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-07-29 03:08:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1053 transitions. [2020-07-29 03:08:20,338 INFO L711 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2020-07-29 03:08:20,338 INFO L591 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2020-07-29 03:08:20,338 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:08:20,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 1053 transitions. [2020-07-29 03:08:20,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2020-07-29 03:08:20,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:08:20,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:08:20,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:20,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:08:20,344 INFO L794 eck$LassoCheckResult]: Stem: 13528#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 13431#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 13432#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 13417#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 13418#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 13510#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 13517#L107 assume !(1 == ~P_1_pc~0); 13521#L107-2 is_P_1_triggered_~__retres1~0 := 0; 13522#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13497#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 13456#L373 assume !(0 != activate_threads_~tmp~1); 13435#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 13436#L189 assume !(1 == ~C_1_pc~0); 13541#L189-2 assume !(2 == ~C_1_pc~0); 13466#L199-1 is_C_1_triggered_~__retres1~1 := 0; 13467#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 13471#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13460#L381 assume !(0 != activate_threads_~tmp___1~1); 13461#L435-1 assume !false; 13752#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 13684#L294 [2020-07-29 03:08:20,344 INFO L796 eck$LassoCheckResult]: Loop: 13684#L294 assume !false; 13749#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13746#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 13744#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13742#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 13740#L274 assume 0 != eval_~tmp___2~0; 13737#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 13734#L283 assume !(0 != eval_~tmp~0); 13663#L279 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 13653#L298 assume !(0 != eval_~tmp___1~0); 13684#L294 [2020-07-29 03:08:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 2 times [2020-07-29 03:08:20,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:20,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867624733] [2020-07-29 03:08:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:20,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:20,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:20,360 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:20,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 2 times [2020-07-29 03:08:20,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:20,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800442793] [2020-07-29 03:08:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:20,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:20,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:20,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:20,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:08:20,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2012858129, now seen corresponding path program 1 times [2020-07-29 03:08:20,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:08:20,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087547972] [2020-07-29 03:08:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:08:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:20,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:08:20,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:08:20,389 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:08:20,655 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2020-07-29 03:08:20,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:08:20 BoogieIcfgContainer [2020-07-29 03:08:20,799 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:08:20,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:08:20,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:08:20,800 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:08:20,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:08:13" (3/4) ... [2020-07-29 03:08:20,805 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 03:08:20,882 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 03:08:20,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:08:20,884 INFO L168 Benchmark]: Toolchain (without parser) took 8415.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 961.6 MB in the beginning and 1.2 GB in the end (delta: -189.3 MB). Peak memory consumption was 120.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:08:20,885 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:08:20,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:08:20,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:08:20,886 INFO L168 Benchmark]: Boogie Preprocessor took 43.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:08:20,886 INFO L168 Benchmark]: RCFGBuilder took 877.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:08:20,887 INFO L168 Benchmark]: BuchiAutomizer took 6899.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -116.5 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:08:20,889 INFO L168 Benchmark]: Witness Printer took 82.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:08:20,891 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 434.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 877.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6899.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -116.5 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. * Witness Printer took 82.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 800 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 650 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 815 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1196 SDtfs, 1400 SDslu, 1460 SDs, 0 SdLazy, 146 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI3 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: 269]: 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 {count=0, \result=0, \result=0, P_1_pc=0, __retres1=0, C_1_i=1, tmp=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fa56a57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a2149b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7df71f43=0, data_0=0, kernel_st=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___0=0, data_1=0, __retres1=1, max_loop=2, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ca91ffc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@502d3b4f=0, C_1_pr=0, \result=0, i=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b4c32c3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24e2eb9d=0, P_1_i=1, e=0, C_1_ev=0, tmp___1=0, __retres1=0, tmp___0=0, num=0, timer=0, P_1_ev=0, tmp=0, C_1_pc=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 269]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int C_1_pc ; [L123] int C_1_st ; [L124] int C_1_i ; [L125] int C_1_ev ; [L126] int C_1_pr ; [L490] int count ; [L491] int __retres2 ; [L495] num = 0 [L496] i = 0 [L497] max_loop = 2 [L499] timer = 0 [L500] P_1_pc = 0 [L501] C_1_pc = 0 [L503] count = 0 [L483] P_1_i = 1 [L484] C_1_i = 1 [L421] int kernel_st ; [L422] int tmp ; [L423] int tmp___0 ; [L427] kernel_st = 0 [L226] COND TRUE (int )P_1_i == 1 [L227] P_1_st = 0 [L231] COND TRUE (int )C_1_i == 1 [L232] C_1_st = 0 [L365] int tmp ; [L366] int tmp___0 ; [L367] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L371] tmp = is_P_1_triggered() [L373] COND FALSE !(\read(tmp)) [L186] int __retres1 ; [L189] COND FALSE !((int )C_1_pc == 1) [L199] COND FALSE !((int )C_1_pc == 2) [L209] __retres1 = 0 [L211] return (__retres1); [L379] tmp___1 = is_C_1_triggered() [L381] COND FALSE !(\read(tmp___1)) [L435] COND TRUE 1 [L438] kernel_st = 1 [L262] int tmp ; [L263] int tmp___0 ; [L264] int tmp___1 ; [L265] int tmp___2 ; Loop: [L269] COND TRUE 1 [L241] int __retres1 ; [L244] COND TRUE (int )P_1_st == 0 [L245] __retres1 = 1 [L258] return (__retres1); [L272] tmp___2 = exists_runnable_thread() [L274] COND TRUE \read(tmp___2) [L279] COND TRUE (int )P_1_st == 0 [L281] tmp = __VERIFIER_nondet_int() [L283] COND FALSE !(\read(tmp)) [L294] COND TRUE (int )C_1_st == 0 [L296] tmp___1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...