./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/bist_cell.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 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-9a8b2e8 [2020-10-20 08:02:05,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:02:05,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:02:05,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:02:05,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:02:05,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:02:05,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:02:05,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:02:05,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:02:05,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:02:05,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:02:05,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:02:05,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:02:05,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:02:05,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:02:05,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:02:05,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:02:05,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:02:05,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:02:05,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:02:05,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:02:05,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:02:05,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:02:05,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:02:05,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:02:05,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:02:05,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:02:05,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:02:05,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:02:05,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:02:05,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:02:05,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:02:05,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:02:05,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:02:05,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:02:05,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:02:05,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:02:05,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:02:05,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:02:05,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:02:05,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:02:05,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:02:05,834 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:02:05,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:02:05,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:02:05,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:02:05,837 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:02:05,837 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:02:05,837 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:02:05,837 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:02:05,838 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:02:05,838 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:02:05,839 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:02:05,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:02:05,839 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:02:05,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:02:05,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:02:05,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:02:05,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:02:05,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:02:05,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:02:05,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:02:05,842 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:02:05,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:02:05,842 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:02:05,842 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:02:05,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:02:05,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:02:05,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:02:05,843 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:02:05,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:02:05,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:02:05,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:02:05,844 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:02:05,846 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:02:05,846 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 -> 6e1b5c8fd87acd5e9c1ad1566c2fb65080de7370 [2020-10-20 08:02:06,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:02:06,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:02:06,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:02:06,060 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:02:06,061 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:02:06,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2020-10-20 08:02:06,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81baab35e/18ec4b2bd9f2429990f49df428849f84/FLAG2ead36dc1 [2020-10-20 08:02:06,635 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:02:06,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2020-10-20 08:02:06,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81baab35e/18ec4b2bd9f2429990f49df428849f84/FLAG2ead36dc1 [2020-10-20 08:02:06,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81baab35e/18ec4b2bd9f2429990f49df428849f84 [2020-10-20 08:02:06,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:02:06,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:02:06,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:02:06,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:02:06,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:02:06,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:02:06" (1/1) ... [2020-10-20 08:02:06,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c2e082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:06, skipping insertion in model container [2020-10-20 08:02:06,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:02:06" (1/1) ... [2020-10-20 08:02:06,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:02:07,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:02:07,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:02:07,349 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:02:07,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:02:07,412 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:02:07,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07 WrapperNode [2020-10-20 08:02:07,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:02:07,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:02:07,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:02:07,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:02:07,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:02:07,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:02:07,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:02:07,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:02:07,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (1/1) ... [2020-10-20 08:02:07,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:02:07,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:02:07,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:02:07,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:02:07,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (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-10-20 08:02:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:02:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:02:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:02:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:02:08,174 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:02:08,175 INFO L298 CfgBuilder]: Removed 66 assume(true) statements. [2020-10-20 08:02:08,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:08 BoogieIcfgContainer [2020-10-20 08:02:08,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:02:08,178 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:02:08,179 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:02:08,189 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:02:08,191 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:08,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:02:06" (1/3) ... [2020-10-20 08:02:08,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26807426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:02:08, skipping insertion in model container [2020-10-20 08:02:08,196 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:08,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:02:07" (2/3) ... [2020-10-20 08:02:08,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26807426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:02:08, skipping insertion in model container [2020-10-20 08:02:08,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:02:08,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:08" (3/3) ... [2020-10-20 08:02:08,199 INFO L373 chiAutomizerObserver]: Analyzing ICFG bist_cell.cil.c [2020-10-20 08:02:08,252 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:02:08,252 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:02:08,253 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:02:08,253 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:02:08,253 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:02:08,254 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:02:08,254 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:02:08,254 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:02:08,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2020-10-20 08:02:08,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:08,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:08,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:08,312 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:08,312 INFO L853 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] [2020-10-20 08:02:08,312 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:02:08,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states. [2020-10-20 08:02:08,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:08,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:08,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:08,321 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:08,321 INFO L853 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] [2020-10-20 08:02:08,329 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3#L-1true havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 56#L482true havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 59#L204true assume !(1 == ~b0_req_up~0); 58#L204-1true assume !(1 == ~b1_req_up~0); 103#L211true assume !(1 == ~d0_req_up~0); 38#L218true assume !(1 == ~d1_req_up~0); 108#L225true assume !(1 == ~z_req_up~0); 26#L232true assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 107#L247-1true assume !(0 == ~b0_ev~0); 98#L313-1true assume !(0 == ~b1_ev~0); 6#L318-1true assume !(0 == ~d0_ev~0); 23#L323-1true assume !(0 == ~d1_ev~0); 49#L328-1true assume !(0 == ~z_ev~0); 65#L333-1true havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 79#L99true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 80#L121true is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 20#L122true activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 90#L382true assume !(0 != activate_threads_~tmp~1); 93#L382-2true assume !(1 == ~b0_ev~0); 95#L346-1true assume !(1 == ~b1_ev~0); 5#L351-1true assume !(1 == ~d0_ev~0); 22#L356-1true assume !(1 == ~d1_ev~0); 46#L361-1true assume !(1 == ~z_ev~0); 60#L424-1true [2020-10-20 08:02:08,330 INFO L796 eck$LassoCheckResult]: Loop: 60#L424-1true assume !false; 15#L425true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 44#L287true assume false; 54#L303true start_simulation_~kernel_st~0 := 2; 57#L204-2true assume !(1 == ~b0_req_up~0); 43#L204-3true assume !(1 == ~b1_req_up~0); 101#L211-1true assume !(1 == ~d0_req_up~0); 53#L218-1true assume !(1 == ~d1_req_up~0); 106#L225-1true assume !(1 == ~z_req_up~0); 24#L232-1true start_simulation_~kernel_st~0 := 3; 99#L313-2true assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 104#L313-4true assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 10#L318-3true assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 27#L323-3true assume !(0 == ~d1_ev~0); 52#L328-3true assume 0 == ~z_ev~0;~z_ev~0 := 1; 69#L333-3true havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 77#L99-1true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 78#L121-1true is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 37#L122-1true activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 94#L382-3true assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 83#L382-5true assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 100#L346-3true assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 9#L351-3true assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 25#L356-3true assume !(1 == ~d1_ev~0); 50#L361-3true assume 1 == ~z_ev~0;~z_ev~0 := 2; 66#L366-3true havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 16#L260-1true assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 70#L267-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 31#L268-1true stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 81#L399true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 14#L406true stop_simulation_#res := stop_simulation_~__retres2~0; 85#L407true start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 39#L441true assume !(0 != start_simulation_~tmp~3); 60#L424-1true [2020-10-20 08:02:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 201072121, now seen corresponding path program 1 times [2020-10-20 08:02:08,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:08,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981041470] [2020-10-20 08:02:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:08,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981041470] [2020-10-20 08:02:08,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:08,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:08,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455251044] [2020-10-20 08:02:08,561 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash -503786151, now seen corresponding path program 1 times [2020-10-20 08:02:08,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:08,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077396744] [2020-10-20 08:02:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:08,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077396744] [2020-10-20 08:02:08,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:08,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:08,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076111692] [2020-10-20 08:02:08,618 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:08,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:08,663 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2020-10-20 08:02:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:08,702 INFO L93 Difference]: Finished difference Result 107 states and 173 transitions. [2020-10-20 08:02:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:08,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 173 transitions. [2020-10-20 08:02:08,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:08,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 167 transitions. [2020-10-20 08:02:08,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:08,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:08,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 167 transitions. [2020-10-20 08:02:08,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:08,734 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2020-10-20 08:02:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 167 transitions. [2020-10-20 08:02:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2020-10-20 08:02:08,770 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2020-10-20 08:02:08,770 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2020-10-20 08:02:08,770 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:02:08,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 167 transitions. [2020-10-20 08:02:08,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:08,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:08,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:08,775 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:08,775 INFO L853 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, 1] [2020-10-20 08:02:08,775 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 224#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 225#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 301#L204 assume 1 == ~b0_req_up~0; 304#L129 assume !(~b0_val~0 != ~b0_val_t~0); 315#L129-2 ~b0_req_up~0 := 0; 303#L204-1 assume !(1 == ~b1_req_up~0); 281#L211 assume !(1 == ~d0_req_up~0); 285#L218 assume !(1 == ~d1_req_up~0); 287#L225 assume !(1 == ~z_req_up~0); 268#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 269#L247-1 assume !(0 == ~b0_ev~0); 321#L313-1 assume !(0 == ~b1_ev~0); 231#L318-1 assume !(0 == ~d0_ev~0); 232#L323-1 assume !(0 == ~d1_ev~0); 264#L328-1 assume !(0 == ~z_ev~0); 296#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 306#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 247#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 259#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 260#L382 assume !(0 != activate_threads_~tmp~1); 316#L382-2 assume !(1 == ~b0_ev~0); 317#L346-1 assume !(1 == ~b1_ev~0); 229#L351-1 assume !(1 == ~d0_ev~0); 230#L356-1 assume !(1 == ~d1_ev~0); 263#L361-1 assume !(1 == ~z_ev~0); 289#L424-1 [2020-10-20 08:02:08,776 INFO L796 eck$LassoCheckResult]: Loop: 289#L424-1 assume !false; 251#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 252#L287 assume !false; 293#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 256#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 257#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 277#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 240#L282 assume !(0 != eval_~tmp___0~0); 242#L303 start_simulation_~kernel_st~0 := 2; 300#L204-2 assume !(1 == ~b0_req_up~0); 292#L204-3 assume !(1 == ~b1_req_up~0); 274#L211-1 assume !(1 == ~d0_req_up~0); 299#L218-1 assume !(1 == ~d1_req_up~0); 272#L225-1 assume !(1 == ~z_req_up~0); 265#L232-1 start_simulation_~kernel_st~0 := 3; 266#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 322#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 238#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 239#L323-3 assume !(0 == ~d1_ev~0); 270#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 298#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 307#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 244#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 283#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 284#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 311#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 312#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 236#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 237#L356-3 assume !(1 == ~d1_ev~0); 267#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 297#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 253#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 254#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 275#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 276#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 249#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 250#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 288#L441 assume !(0 != start_simulation_~tmp~3); 289#L424-1 [2020-10-20 08:02:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash 987671025, now seen corresponding path program 1 times [2020-10-20 08:02:08,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:08,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829846742] [2020-10-20 08:02:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:08,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829846742] [2020-10-20 08:02:08,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:08,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:08,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229147742] [2020-10-20 08:02:08,854 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 1 times [2020-10-20 08:02:08,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:08,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106153347] [2020-10-20 08:02:08,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:08,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106153347] [2020-10-20 08:02:08,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:08,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:08,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770217012] [2020-10-20 08:02:08,904 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:08,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:08,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:08,906 INFO L87 Difference]: Start difference. First operand 101 states and 167 transitions. cyclomatic complexity: 67 Second operand 3 states. [2020-10-20 08:02:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:08,930 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2020-10-20 08:02:08,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:08,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 166 transitions. [2020-10-20 08:02:08,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:08,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 166 transitions. [2020-10-20 08:02:08,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:08,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:08,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 166 transitions. [2020-10-20 08:02:08,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:08,938 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2020-10-20 08:02:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 166 transitions. [2020-10-20 08:02:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 166 transitions. [2020-10-20 08:02:08,945 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2020-10-20 08:02:08,945 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2020-10-20 08:02:08,946 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:02:08,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 166 transitions. [2020-10-20 08:02:08,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:08,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:08,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:08,949 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:08,950 INFO L853 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, 1] [2020-10-20 08:02:08,962 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 435#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 436#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 512#L204 assume 1 == ~b0_req_up~0; 515#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 526#L129-2 ~b0_req_up~0 := 0; 514#L204-1 assume !(1 == ~b1_req_up~0); 492#L211 assume !(1 == ~d0_req_up~0); 496#L218 assume !(1 == ~d1_req_up~0); 498#L225 assume !(1 == ~z_req_up~0); 479#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 480#L247-1 assume !(0 == ~b0_ev~0); 532#L313-1 assume !(0 == ~b1_ev~0); 442#L318-1 assume !(0 == ~d0_ev~0); 443#L323-1 assume !(0 == ~d1_ev~0); 475#L328-1 assume !(0 == ~z_ev~0); 507#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 517#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 458#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 470#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 471#L382 assume !(0 != activate_threads_~tmp~1); 527#L382-2 assume !(1 == ~b0_ev~0); 528#L346-1 assume !(1 == ~b1_ev~0); 440#L351-1 assume !(1 == ~d0_ev~0); 441#L356-1 assume !(1 == ~d1_ev~0); 474#L361-1 assume !(1 == ~z_ev~0); 500#L424-1 [2020-10-20 08:02:08,964 INFO L796 eck$LassoCheckResult]: Loop: 500#L424-1 assume !false; 462#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 463#L287 assume !false; 504#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 467#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 468#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 488#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 451#L282 assume !(0 != eval_~tmp___0~0); 453#L303 start_simulation_~kernel_st~0 := 2; 511#L204-2 assume !(1 == ~b0_req_up~0); 503#L204-3 assume !(1 == ~b1_req_up~0); 485#L211-1 assume !(1 == ~d0_req_up~0); 510#L218-1 assume !(1 == ~d1_req_up~0); 483#L225-1 assume !(1 == ~z_req_up~0); 476#L232-1 start_simulation_~kernel_st~0 := 3; 477#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 533#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 449#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 450#L323-3 assume !(0 == ~d1_ev~0); 481#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 509#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 518#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 455#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 494#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 495#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 522#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 523#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 447#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 448#L356-3 assume !(1 == ~d1_ev~0); 478#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 508#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 464#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 465#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 486#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 487#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 460#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 461#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 499#L441 assume !(0 != start_simulation_~tmp~3); 500#L424-1 [2020-10-20 08:02:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:08,965 INFO L82 PathProgramCache]: Analyzing trace with hash 768816307, now seen corresponding path program 1 times [2020-10-20 08:02:08,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:08,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60548626] [2020-10-20 08:02:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60548626] [2020-10-20 08:02:09,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:09,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147717364] [2020-10-20 08:02:09,059 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 2 times [2020-10-20 08:02:09,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963586532] [2020-10-20 08:02:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963586532] [2020-10-20 08:02:09,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:09,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737470560] [2020-10-20 08:02:09,141 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:09,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:09,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:09,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:09,143 INFO L87 Difference]: Start difference. First operand 101 states and 166 transitions. cyclomatic complexity: 66 Second operand 3 states. [2020-10-20 08:02:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:09,170 INFO L93 Difference]: Finished difference Result 101 states and 165 transitions. [2020-10-20 08:02:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:09,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 165 transitions. [2020-10-20 08:02:09,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 165 transitions. [2020-10-20 08:02:09,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:09,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:09,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 165 transitions. [2020-10-20 08:02:09,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:09,178 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2020-10-20 08:02:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 165 transitions. [2020-10-20 08:02:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 165 transitions. [2020-10-20 08:02:09,184 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2020-10-20 08:02:09,185 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2020-10-20 08:02:09,185 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:02:09,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 165 transitions. [2020-10-20 08:02:09,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:09,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:09,188 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:09,188 INFO L853 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, 1] [2020-10-20 08:02:09,189 INFO L794 eck$LassoCheckResult]: Stem: 730#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 646#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 647#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 723#L204 assume 1 == ~b0_req_up~0; 726#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 737#L129-2 ~b0_req_up~0 := 0; 725#L204-1 assume 1 == ~b1_req_up~0; 683#L144 assume !(~b1_val~0 != ~b1_val_t~0); 684#L144-2 ~b1_req_up~0 := 0; 703#L211 assume !(1 == ~d0_req_up~0); 707#L218 assume !(1 == ~d1_req_up~0); 709#L225 assume !(1 == ~z_req_up~0); 690#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 691#L247-1 assume !(0 == ~b0_ev~0); 743#L313-1 assume !(0 == ~b1_ev~0); 653#L318-1 assume !(0 == ~d0_ev~0); 654#L323-1 assume !(0 == ~d1_ev~0); 686#L328-1 assume !(0 == ~z_ev~0); 718#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 728#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 669#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 681#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 682#L382 assume !(0 != activate_threads_~tmp~1); 738#L382-2 assume !(1 == ~b0_ev~0); 739#L346-1 assume !(1 == ~b1_ev~0); 651#L351-1 assume !(1 == ~d0_ev~0); 652#L356-1 assume !(1 == ~d1_ev~0); 685#L361-1 assume !(1 == ~z_ev~0); 711#L424-1 [2020-10-20 08:02:09,189 INFO L796 eck$LassoCheckResult]: Loop: 711#L424-1 assume !false; 673#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 674#L287 assume !false; 715#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 678#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 679#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 699#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 662#L282 assume !(0 != eval_~tmp___0~0); 664#L303 start_simulation_~kernel_st~0 := 2; 722#L204-2 assume !(1 == ~b0_req_up~0); 714#L204-3 assume !(1 == ~b1_req_up~0); 696#L211-1 assume !(1 == ~d0_req_up~0); 721#L218-1 assume !(1 == ~d1_req_up~0); 694#L225-1 assume !(1 == ~z_req_up~0); 687#L232-1 start_simulation_~kernel_st~0 := 3; 688#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 744#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 660#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 661#L323-3 assume !(0 == ~d1_ev~0); 692#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 720#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 729#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 666#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 705#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 706#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 733#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 734#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 658#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 659#L356-3 assume !(1 == ~d1_ev~0); 689#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 719#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 675#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 676#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 697#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 698#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 671#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 672#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 710#L441 assume !(0 != start_simulation_~tmp~3); 711#L424-1 [2020-10-20 08:02:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1003190981, now seen corresponding path program 1 times [2020-10-20 08:02:09,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102504855] [2020-10-20 08:02:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102504855] [2020-10-20 08:02:09,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:09,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860806935] [2020-10-20 08:02:09,245 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 3 times [2020-10-20 08:02:09,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636959914] [2020-10-20 08:02:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636959914] [2020-10-20 08:02:09,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:09,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569659889] [2020-10-20 08:02:09,279 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:09,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:09,280 INFO L87 Difference]: Start difference. First operand 101 states and 165 transitions. cyclomatic complexity: 65 Second operand 4 states. [2020-10-20 08:02:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:09,322 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2020-10-20 08:02:09,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:02:09,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 164 transitions. [2020-10-20 08:02:09,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 164 transitions. [2020-10-20 08:02:09,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:09,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:09,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 164 transitions. [2020-10-20 08:02:09,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:09,329 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2020-10-20 08:02:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 164 transitions. [2020-10-20 08:02:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 164 transitions. [2020-10-20 08:02:09,343 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2020-10-20 08:02:09,343 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2020-10-20 08:02:09,343 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:02:09,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 164 transitions. [2020-10-20 08:02:09,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:09,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:09,349 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:09,349 INFO L853 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, 1] [2020-10-20 08:02:09,349 INFO L794 eck$LassoCheckResult]: Stem: 944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 863#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 864#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 937#L204 assume 1 == ~b0_req_up~0; 940#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 951#L129-2 ~b0_req_up~0 := 0; 939#L204-1 assume 1 == ~b1_req_up~0; 898#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 899#L144-2 ~b1_req_up~0 := 0; 918#L211 assume !(1 == ~d0_req_up~0); 921#L218 assume !(1 == ~d1_req_up~0); 923#L225 assume !(1 == ~z_req_up~0); 904#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 905#L247-1 assume !(0 == ~b0_ev~0); 957#L313-1 assume !(0 == ~b1_ev~0); 867#L318-1 assume !(0 == ~d0_ev~0); 868#L323-1 assume !(0 == ~d1_ev~0); 900#L328-1 assume !(0 == ~z_ev~0); 932#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 942#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 883#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 895#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 896#L382 assume !(0 != activate_threads_~tmp~1); 952#L382-2 assume !(1 == ~b0_ev~0); 953#L346-1 assume !(1 == ~b1_ev~0); 865#L351-1 assume !(1 == ~d0_ev~0); 866#L356-1 assume !(1 == ~d1_ev~0); 897#L361-1 assume !(1 == ~z_ev~0); 925#L424-1 [2020-10-20 08:02:09,350 INFO L796 eck$LassoCheckResult]: Loop: 925#L424-1 assume !false; 887#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 888#L287 assume !false; 929#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 892#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 893#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 913#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 876#L282 assume !(0 != eval_~tmp___0~0); 878#L303 start_simulation_~kernel_st~0 := 2; 936#L204-2 assume !(1 == ~b0_req_up~0); 928#L204-3 assume !(1 == ~b1_req_up~0); 910#L211-1 assume !(1 == ~d0_req_up~0); 935#L218-1 assume !(1 == ~d1_req_up~0); 908#L225-1 assume !(1 == ~z_req_up~0); 901#L232-1 start_simulation_~kernel_st~0 := 3; 902#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 958#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 874#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 875#L323-3 assume !(0 == ~d1_ev~0); 906#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 934#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 943#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 880#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 919#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 920#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 947#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 948#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 872#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 873#L356-3 assume !(1 == ~d1_ev~0); 903#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 933#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 889#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 890#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 911#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 912#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 885#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 886#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 924#L441 assume !(0 != start_simulation_~tmp~3); 925#L424-1 [2020-10-20 08:02:09,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1425892807, now seen corresponding path program 1 times [2020-10-20 08:02:09,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001101488] [2020-10-20 08:02:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001101488] [2020-10-20 08:02:09,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:09,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380421368] [2020-10-20 08:02:09,409 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 4 times [2020-10-20 08:02:09,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880601630] [2020-10-20 08:02:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880601630] [2020-10-20 08:02:09,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:09,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246706692] [2020-10-20 08:02:09,471 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:09,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:09,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:09,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:09,472 INFO L87 Difference]: Start difference. First operand 101 states and 164 transitions. cyclomatic complexity: 64 Second operand 3 states. [2020-10-20 08:02:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:09,485 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2020-10-20 08:02:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:09,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 163 transitions. [2020-10-20 08:02:09,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 163 transitions. [2020-10-20 08:02:09,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:09,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:09,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 163 transitions. [2020-10-20 08:02:09,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:09,490 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-20 08:02:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 163 transitions. [2020-10-20 08:02:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2020-10-20 08:02:09,495 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-20 08:02:09,495 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-10-20 08:02:09,495 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:02:09,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 163 transitions. [2020-10-20 08:02:09,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:09,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:09,498 INFO L852 BuchiCegarLoop]: Counterexample stem 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-10-20 08:02:09,498 INFO L853 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, 1] [2020-10-20 08:02:09,498 INFO L794 eck$LassoCheckResult]: Stem: 1155#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1074#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1075#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1148#L204 assume 1 == ~b0_req_up~0; 1151#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1162#L129-2 ~b0_req_up~0 := 0; 1150#L204-1 assume 1 == ~b1_req_up~0; 1108#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1109#L144-2 ~b1_req_up~0 := 0; 1129#L211 assume 1 == ~d0_req_up~0; 1171#L159 assume !(~d0_val~0 != ~d0_val_t~0); 1161#L159-2 ~d0_req_up~0 := 0; 1134#L218 assume !(1 == ~d1_req_up~0); 1136#L225 assume !(1 == ~z_req_up~0); 1115#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1116#L247-1 assume !(0 == ~b0_ev~0); 1168#L313-1 assume !(0 == ~b1_ev~0); 1080#L318-1 assume !(0 == ~d0_ev~0); 1081#L323-1 assume !(0 == ~d1_ev~0); 1111#L328-1 assume !(0 == ~z_ev~0); 1143#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1153#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1094#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1106#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1107#L382 assume !(0 != activate_threads_~tmp~1); 1163#L382-2 assume !(1 == ~b0_ev~0); 1164#L346-1 assume !(1 == ~b1_ev~0); 1076#L351-1 assume !(1 == ~d0_ev~0); 1077#L356-1 assume !(1 == ~d1_ev~0); 1110#L361-1 assume !(1 == ~z_ev~0); 1133#L424-1 [2020-10-20 08:02:09,499 INFO L796 eck$LassoCheckResult]: Loop: 1133#L424-1 assume !false; 1098#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1099#L287 assume !false; 1140#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1103#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1104#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1124#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1087#L282 assume !(0 != eval_~tmp___0~0); 1089#L303 start_simulation_~kernel_st~0 := 2; 1147#L204-2 assume !(1 == ~b0_req_up~0); 1139#L204-3 assume !(1 == ~b1_req_up~0); 1121#L211-1 assume !(1 == ~d0_req_up~0); 1146#L218-1 assume !(1 == ~d1_req_up~0); 1119#L225-1 assume !(1 == ~z_req_up~0); 1112#L232-1 start_simulation_~kernel_st~0 := 3; 1113#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1169#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1085#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1086#L323-3 assume !(0 == ~d1_ev~0); 1117#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1145#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1154#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1091#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1130#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1131#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1158#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1159#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1083#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1084#L356-3 assume !(1 == ~d1_ev~0); 1114#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1144#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1100#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1101#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1122#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1123#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1096#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1097#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1132#L441 assume !(0 != start_simulation_~tmp~3); 1133#L424-1 [2020-10-20 08:02:09,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash -665750479, now seen corresponding path program 1 times [2020-10-20 08:02:09,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815175196] [2020-10-20 08:02:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815175196] [2020-10-20 08:02:09,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:09,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574779095] [2020-10-20 08:02:09,535 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 5 times [2020-10-20 08:02:09,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182719387] [2020-10-20 08:02:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182719387] [2020-10-20 08:02:09,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:09,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661218235] [2020-10-20 08:02:09,572 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:09,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:09,572 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. cyclomatic complexity: 63 Second operand 4 states. [2020-10-20 08:02:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:09,632 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2020-10-20 08:02:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:02:09,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 162 transitions. [2020-10-20 08:02:09,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 162 transitions. [2020-10-20 08:02:09,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:09,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:09,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 162 transitions. [2020-10-20 08:02:09,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:09,637 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-20 08:02:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 162 transitions. [2020-10-20 08:02:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2020-10-20 08:02:09,642 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-20 08:02:09,642 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-10-20 08:02:09,643 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:02:09,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 162 transitions. [2020-10-20 08:02:09,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:09,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:09,645 INFO L852 BuchiCegarLoop]: Counterexample stem 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-10-20 08:02:09,645 INFO L853 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, 1] [2020-10-20 08:02:09,646 INFO L794 eck$LassoCheckResult]: Stem: 1369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1285#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1286#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1362#L204 assume 1 == ~b0_req_up~0; 1365#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1376#L129-2 ~b0_req_up~0 := 0; 1364#L204-1 assume 1 == ~b1_req_up~0; 1322#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1323#L144-2 ~b1_req_up~0 := 0; 1342#L211 assume 1 == ~d0_req_up~0; 1385#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1375#L159-2 ~d0_req_up~0 := 0; 1348#L218 assume !(1 == ~d1_req_up~0); 1350#L225 assume !(1 == ~z_req_up~0); 1329#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1330#L247-1 assume !(0 == ~b0_ev~0); 1382#L313-1 assume !(0 == ~b1_ev~0); 1292#L318-1 assume !(0 == ~d0_ev~0); 1293#L323-1 assume !(0 == ~d1_ev~0); 1325#L328-1 assume !(0 == ~z_ev~0); 1357#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1367#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1308#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1320#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1321#L382 assume !(0 != activate_threads_~tmp~1); 1377#L382-2 assume !(1 == ~b0_ev~0); 1378#L346-1 assume !(1 == ~b1_ev~0); 1290#L351-1 assume !(1 == ~d0_ev~0); 1291#L356-1 assume !(1 == ~d1_ev~0); 1324#L361-1 assume !(1 == ~z_ev~0); 1347#L424-1 [2020-10-20 08:02:09,646 INFO L796 eck$LassoCheckResult]: Loop: 1347#L424-1 assume !false; 1312#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1313#L287 assume !false; 1354#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1317#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1318#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1338#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1301#L282 assume !(0 != eval_~tmp___0~0); 1303#L303 start_simulation_~kernel_st~0 := 2; 1361#L204-2 assume !(1 == ~b0_req_up~0); 1353#L204-3 assume !(1 == ~b1_req_up~0); 1337#L211-1 assume !(1 == ~d0_req_up~0); 1360#L218-1 assume !(1 == ~d1_req_up~0); 1333#L225-1 assume !(1 == ~z_req_up~0); 1326#L232-1 start_simulation_~kernel_st~0 := 3; 1327#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1383#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1299#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1300#L323-3 assume !(0 == ~d1_ev~0); 1331#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1359#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1368#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1305#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1344#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1345#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1372#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1373#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1297#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1298#L356-3 assume !(1 == ~d1_ev~0); 1328#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1358#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1314#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1315#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1334#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1335#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1310#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1311#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1346#L441 assume !(0 != start_simulation_~tmp~3); 1347#L424-1 [2020-10-20 08:02:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 151897971, now seen corresponding path program 1 times [2020-10-20 08:02:09,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231766402] [2020-10-20 08:02:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231766402] [2020-10-20 08:02:09,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:09,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492956188] [2020-10-20 08:02:09,674 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:09,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 6 times [2020-10-20 08:02:09,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885817497] [2020-10-20 08:02:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885817497] [2020-10-20 08:02:09,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:09,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262770835] [2020-10-20 08:02:09,704 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:09,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:09,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:09,705 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. cyclomatic complexity: 62 Second operand 3 states. [2020-10-20 08:02:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:09,718 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2020-10-20 08:02:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:09,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 161 transitions. [2020-10-20 08:02:09,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 161 transitions. [2020-10-20 08:02:09,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:09,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:09,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 161 transitions. [2020-10-20 08:02:09,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:09,722 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2020-10-20 08:02:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 161 transitions. [2020-10-20 08:02:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2020-10-20 08:02:09,726 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2020-10-20 08:02:09,727 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2020-10-20 08:02:09,727 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:02:09,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 161 transitions. [2020-10-20 08:02:09,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:09,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:09,729 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:09,729 INFO L853 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, 1] [2020-10-20 08:02:09,729 INFO L794 eck$LassoCheckResult]: Stem: 1580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1496#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1497#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1573#L204 assume 1 == ~b0_req_up~0; 1576#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1587#L129-2 ~b0_req_up~0 := 0; 1575#L204-1 assume 1 == ~b1_req_up~0; 1533#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1534#L144-2 ~b1_req_up~0 := 0; 1553#L211 assume 1 == ~d0_req_up~0; 1596#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1586#L159-2 ~d0_req_up~0 := 0; 1557#L218 assume 1 == ~d1_req_up~0; 1558#L174 assume !(~d1_val~0 != ~d1_val_t~0); 1566#L174-2 ~d1_req_up~0 := 0; 1567#L225 assume !(1 == ~z_req_up~0); 1540#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1541#L247-1 assume !(0 == ~b0_ev~0); 1593#L313-1 assume !(0 == ~b1_ev~0); 1503#L318-1 assume !(0 == ~d0_ev~0); 1504#L323-1 assume !(0 == ~d1_ev~0); 1536#L328-1 assume !(0 == ~z_ev~0); 1568#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1578#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1519#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1531#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1532#L382 assume !(0 != activate_threads_~tmp~1); 1588#L382-2 assume !(1 == ~b0_ev~0); 1589#L346-1 assume !(1 == ~b1_ev~0); 1501#L351-1 assume !(1 == ~d0_ev~0); 1502#L356-1 assume !(1 == ~d1_ev~0); 1535#L361-1 assume !(1 == ~z_ev~0); 1560#L424-1 [2020-10-20 08:02:09,730 INFO L796 eck$LassoCheckResult]: Loop: 1560#L424-1 assume !false; 1523#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1524#L287 assume !false; 1564#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1528#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1529#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1549#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1512#L282 assume !(0 != eval_~tmp___0~0); 1514#L303 start_simulation_~kernel_st~0 := 2; 1572#L204-2 assume !(1 == ~b0_req_up~0); 1563#L204-3 assume !(1 == ~b1_req_up~0); 1546#L211-1 assume !(1 == ~d0_req_up~0); 1571#L218-1 assume !(1 == ~d1_req_up~0); 1544#L225-1 assume !(1 == ~z_req_up~0); 1537#L232-1 start_simulation_~kernel_st~0 := 3; 1538#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1594#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1510#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1511#L323-3 assume !(0 == ~d1_ev~0); 1542#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1570#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1579#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1516#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1555#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1556#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1583#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1584#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1508#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1509#L356-3 assume !(1 == ~d1_ev~0); 1539#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1569#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1525#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1526#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1547#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1548#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1521#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1522#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1559#L441 assume !(0 != start_simulation_~tmp~3); 1560#L424-1 [2020-10-20 08:02:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash -650688005, now seen corresponding path program 1 times [2020-10-20 08:02:09,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120231202] [2020-10-20 08:02:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,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-10-20 08:02:09,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120231202] [2020-10-20 08:02:09,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:09,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570322167] [2020-10-20 08:02:09,787 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 7 times [2020-10-20 08:02:09,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017884486] [2020-10-20 08:02:09,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017884486] [2020-10-20 08:02:09,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:09,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831554308] [2020-10-20 08:02:09,819 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:09,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:09,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:09,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:09,819 INFO L87 Difference]: Start difference. First operand 101 states and 161 transitions. cyclomatic complexity: 61 Second operand 4 states. [2020-10-20 08:02:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:09,853 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2020-10-20 08:02:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:02:09,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 160 transitions. [2020-10-20 08:02:09,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 160 transitions. [2020-10-20 08:02:09,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:09,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:09,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 160 transitions. [2020-10-20 08:02:09,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:09,857 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-20 08:02:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 160 transitions. [2020-10-20 08:02:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-10-20 08:02:09,861 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-20 08:02:09,861 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-20 08:02:09,861 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:02:09,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 160 transitions. [2020-10-20 08:02:09,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:09,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:09,863 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:09,863 INFO L853 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, 1] [2020-10-20 08:02:09,864 INFO L794 eck$LassoCheckResult]: Stem: 1794#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1710#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1711#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1787#L204 assume 1 == ~b0_req_up~0; 1790#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1801#L129-2 ~b0_req_up~0 := 0; 1789#L204-1 assume 1 == ~b1_req_up~0; 1747#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1748#L144-2 ~b1_req_up~0 := 0; 1767#L211 assume 1 == ~d0_req_up~0; 1810#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1800#L159-2 ~d0_req_up~0 := 0; 1771#L218 assume 1 == ~d1_req_up~0; 1772#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 1780#L174-2 ~d1_req_up~0 := 0; 1781#L225 assume !(1 == ~z_req_up~0); 1754#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1755#L247-1 assume !(0 == ~b0_ev~0); 1807#L313-1 assume !(0 == ~b1_ev~0); 1717#L318-1 assume !(0 == ~d0_ev~0); 1718#L323-1 assume !(0 == ~d1_ev~0); 1750#L328-1 assume !(0 == ~z_ev~0); 1782#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1792#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1733#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1745#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1746#L382 assume !(0 != activate_threads_~tmp~1); 1802#L382-2 assume !(1 == ~b0_ev~0); 1803#L346-1 assume !(1 == ~b1_ev~0); 1715#L351-1 assume !(1 == ~d0_ev~0); 1716#L356-1 assume !(1 == ~d1_ev~0); 1749#L361-1 assume !(1 == ~z_ev~0); 1774#L424-1 [2020-10-20 08:02:09,864 INFO L796 eck$LassoCheckResult]: Loop: 1774#L424-1 assume !false; 1737#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1738#L287 assume !false; 1778#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1742#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1743#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1763#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1726#L282 assume !(0 != eval_~tmp___0~0); 1728#L303 start_simulation_~kernel_st~0 := 2; 1786#L204-2 assume !(1 == ~b0_req_up~0); 1777#L204-3 assume !(1 == ~b1_req_up~0); 1760#L211-1 assume !(1 == ~d0_req_up~0); 1785#L218-1 assume !(1 == ~d1_req_up~0); 1758#L225-1 assume !(1 == ~z_req_up~0); 1751#L232-1 start_simulation_~kernel_st~0 := 3; 1752#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1808#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1724#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1725#L323-3 assume !(0 == ~d1_ev~0); 1756#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1784#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 1793#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1730#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1769#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1770#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1797#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1798#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1722#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1723#L356-3 assume !(1 == ~d1_ev~0); 1753#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1783#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1739#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1740#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1761#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1762#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1735#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1736#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1773#L441 assume !(0 != start_simulation_~tmp~3); 1774#L424-1 [2020-10-20 08:02:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1038255737, now seen corresponding path program 1 times [2020-10-20 08:02:09,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648252788] [2020-10-20 08:02:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648252788] [2020-10-20 08:02:09,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:09,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078232116] [2020-10-20 08:02:09,911 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 8 times [2020-10-20 08:02:09,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994832122] [2020-10-20 08:02:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:09,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994832122] [2020-10-20 08:02:09,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:09,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:09,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240862978] [2020-10-20 08:02:09,938 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:09,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:09,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:09,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:09,939 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. cyclomatic complexity: 60 Second operand 4 states. [2020-10-20 08:02:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:09,964 INFO L93 Difference]: Finished difference Result 101 states and 159 transitions. [2020-10-20 08:02:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:02:09,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 159 transitions. [2020-10-20 08:02:09,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 159 transitions. [2020-10-20 08:02:09,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2020-10-20 08:02:09,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2020-10-20 08:02:09,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 159 transitions. [2020-10-20 08:02:09,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:09,968 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2020-10-20 08:02:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 159 transitions. [2020-10-20 08:02:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 08:02:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 08:02:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2020-10-20 08:02:09,972 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2020-10-20 08:02:09,972 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2020-10-20 08:02:09,973 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:02:09,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 159 transitions. [2020-10-20 08:02:09,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2020-10-20 08:02:09,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:09,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:09,975 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:09,975 INFO L853 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, 1] [2020-10-20 08:02:09,976 INFO L794 eck$LassoCheckResult]: Stem: 2008#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1924#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1925#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2001#L204 assume 1 == ~b0_req_up~0; 2004#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2015#L129-2 ~b0_req_up~0 := 0; 2003#L204-1 assume 1 == ~b1_req_up~0; 1961#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1962#L144-2 ~b1_req_up~0 := 0; 1981#L211 assume 1 == ~d0_req_up~0; 2024#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2014#L159-2 ~d0_req_up~0 := 0; 1985#L218 assume 1 == ~d1_req_up~0; 1986#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 1994#L174-2 ~d1_req_up~0 := 0; 1995#L225 assume !(1 == ~z_req_up~0); 1968#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 1969#L247-1 assume !(0 == ~b0_ev~0); 2021#L313-1 assume !(0 == ~b1_ev~0); 1931#L318-1 assume !(0 == ~d0_ev~0); 1932#L323-1 assume !(0 == ~d1_ev~0); 1964#L328-1 assume !(0 == ~z_ev~0); 1996#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2006#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1947#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1959#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1960#L382 assume !(0 != activate_threads_~tmp~1); 2016#L382-2 assume !(1 == ~b0_ev~0); 2017#L346-1 assume !(1 == ~b1_ev~0); 1929#L351-1 assume !(1 == ~d0_ev~0); 1930#L356-1 assume !(1 == ~d1_ev~0); 1963#L361-1 assume !(1 == ~z_ev~0); 1988#L424-1 [2020-10-20 08:02:09,976 INFO L796 eck$LassoCheckResult]: Loop: 1988#L424-1 assume !false; 1951#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1952#L287 assume !false; 1992#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1956#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1957#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1977#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1940#L282 assume !(0 != eval_~tmp___0~0); 1942#L303 start_simulation_~kernel_st~0 := 2; 2000#L204-2 assume !(1 == ~b0_req_up~0); 1991#L204-3 assume !(1 == ~b1_req_up~0); 1974#L211-1 assume !(1 == ~d0_req_up~0); 1999#L218-1 assume !(1 == ~d1_req_up~0); 1972#L225-1 assume !(1 == ~z_req_up~0); 1965#L232-1 start_simulation_~kernel_st~0 := 3; 1966#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2022#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1938#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1939#L323-3 assume !(0 == ~d1_ev~0); 1970#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1998#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2007#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1944#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1983#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1984#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2011#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2012#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1936#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1937#L356-3 assume !(1 == ~d1_ev~0); 1967#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1997#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 1953#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1954#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1975#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1976#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1949#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1950#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1987#L441 assume !(0 != start_simulation_~tmp~3); 1988#L424-1 [2020-10-20 08:02:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash 17187383, now seen corresponding path program 1 times [2020-10-20 08:02:09,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:09,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242550659] [2020-10-20 08:02:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242550659] [2020-10-20 08:02:10,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:10,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401898874] [2020-10-20 08:02:10,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 9 times [2020-10-20 08:02:10,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737746948] [2020-10-20 08:02:10,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737746948] [2020-10-20 08:02:10,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728559586] [2020-10-20 08:02:10,027 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:10,028 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. cyclomatic complexity: 59 Second operand 3 states. [2020-10-20 08:02:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,054 INFO L93 Difference]: Finished difference Result 116 states and 181 transitions. [2020-10-20 08:02:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:10,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2020-10-20 08:02:10,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-10-20 08:02:10,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 181 transitions. [2020-10-20 08:02:10,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-10-20 08:02:10,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-10-20 08:02:10,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 181 transitions. [2020-10-20 08:02:10,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,074 INFO L691 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2020-10-20 08:02:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 181 transitions. [2020-10-20 08:02:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-10-20 08:02:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-20 08:02:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2020-10-20 08:02:10,076 INFO L714 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2020-10-20 08:02:10,076 INFO L594 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2020-10-20 08:02:10,076 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:02:10,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 181 transitions. [2020-10-20 08:02:10,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-10-20 08:02:10,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:10,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:10,078 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:10,078 INFO L853 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, 1] [2020-10-20 08:02:10,078 INFO L794 eck$LassoCheckResult]: Stem: 2236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2153#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2154#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2227#L204 assume 1 == ~b0_req_up~0; 2231#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2243#L129-2 ~b0_req_up~0 := 0; 2230#L204-1 assume 1 == ~b1_req_up~0; 2188#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2189#L144-2 ~b1_req_up~0 := 0; 2208#L211 assume 1 == ~d0_req_up~0; 2252#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2242#L159-2 ~d0_req_up~0 := 0; 2213#L218 assume 1 == ~d1_req_up~0; 2214#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2220#L174-2 ~d1_req_up~0 := 0; 2221#L225 assume !(1 == ~z_req_up~0); 2194#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2195#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2249#L313-1 assume !(0 == ~b1_ev~0); 2157#L318-1 assume !(0 == ~d0_ev~0); 2158#L323-1 assume !(0 == ~d1_ev~0); 2190#L328-1 assume !(0 == ~z_ev~0); 2222#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2233#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2173#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2185#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2186#L382 assume !(0 != activate_threads_~tmp~1); 2244#L382-2 assume !(1 == ~b0_ev~0); 2245#L346-1 assume !(1 == ~b1_ev~0); 2155#L351-1 assume !(1 == ~d0_ev~0); 2156#L356-1 assume !(1 == ~d1_ev~0); 2187#L361-1 assume !(1 == ~z_ev~0); 2212#L424-1 [2020-10-20 08:02:10,078 INFO L796 eck$LassoCheckResult]: Loop: 2212#L424-1 assume !false; 2177#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2178#L287 assume !false; 2218#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2182#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2183#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2203#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2166#L282 assume !(0 != eval_~tmp___0~0); 2168#L303 start_simulation_~kernel_st~0 := 2; 2226#L204-2 assume !(1 == ~b0_req_up~0); 2229#L204-3 assume !(1 == ~b1_req_up~0); 2262#L211-1 assume !(1 == ~d0_req_up~0); 2259#L218-1 assume !(1 == ~d1_req_up~0); 2256#L225-1 assume !(1 == ~z_req_up~0); 2254#L232-1 start_simulation_~kernel_st~0 := 3; 2253#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2250#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2164#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2165#L323-3 assume !(0 == ~d1_ev~0); 2196#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2224#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2235#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2170#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2209#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2210#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2239#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2240#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2162#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2163#L356-3 assume !(1 == ~d1_ev~0); 2193#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2223#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 2179#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2180#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2201#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2202#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2175#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2176#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2211#L441 assume !(0 != start_simulation_~tmp~3); 2212#L424-1 [2020-10-20 08:02:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1297051061, now seen corresponding path program 1 times [2020-10-20 08:02:10,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512172317] [2020-10-20 08:02:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512172317] [2020-10-20 08:02:10,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:10,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813300857] [2020-10-20 08:02:10,101 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 10 times [2020-10-20 08:02:10,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671654608] [2020-10-20 08:02:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671654608] [2020-10-20 08:02:10,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665608821] [2020-10-20 08:02:10,125 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:10,126 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. cyclomatic complexity: 66 Second operand 3 states. [2020-10-20 08:02:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,150 INFO L93 Difference]: Finished difference Result 141 states and 218 transitions. [2020-10-20 08:02:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:10,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 218 transitions. [2020-10-20 08:02:10,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2020-10-20 08:02:10,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 141 states and 218 transitions. [2020-10-20 08:02:10,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2020-10-20 08:02:10,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2020-10-20 08:02:10,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 218 transitions. [2020-10-20 08:02:10,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,155 INFO L691 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2020-10-20 08:02:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 218 transitions. [2020-10-20 08:02:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-10-20 08:02:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-20 08:02:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 218 transitions. [2020-10-20 08:02:10,158 INFO L714 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2020-10-20 08:02:10,158 INFO L594 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2020-10-20 08:02:10,158 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:02:10,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 218 transitions. [2020-10-20 08:02:10,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2020-10-20 08:02:10,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:10,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:10,160 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:10,160 INFO L853 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, 1] [2020-10-20 08:02:10,161 INFO L794 eck$LassoCheckResult]: Stem: 2504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2419#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2420#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2495#L204 assume 1 == ~b0_req_up~0; 2499#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2511#L129-2 ~b0_req_up~0 := 0; 2498#L204-1 assume 1 == ~b1_req_up~0; 2454#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2455#L144-2 ~b1_req_up~0 := 0; 2475#L211 assume 1 == ~d0_req_up~0; 2520#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2510#L159-2 ~d0_req_up~0 := 0; 2480#L218 assume 1 == ~d1_req_up~0; 2481#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2488#L174-2 ~d1_req_up~0 := 0; 2489#L225 assume !(1 == ~z_req_up~0); 2460#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2461#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2517#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2425#L318-1 assume !(0 == ~d0_ev~0); 2426#L323-1 assume !(0 == ~d1_ev~0); 2456#L328-1 assume !(0 == ~z_ev~0); 2490#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2501#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2439#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2451#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2452#L382 assume !(0 != activate_threads_~tmp~1); 2512#L382-2 assume !(1 == ~b0_ev~0); 2513#L346-1 assume !(1 == ~b1_ev~0); 2421#L351-1 assume !(1 == ~d0_ev~0); 2422#L356-1 assume !(1 == ~d1_ev~0); 2453#L361-1 assume !(1 == ~z_ev~0); 2479#L424-1 [2020-10-20 08:02:10,161 INFO L796 eck$LassoCheckResult]: Loop: 2479#L424-1 assume !false; 2443#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2444#L287 assume !false; 2486#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2448#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2449#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2469#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2432#L282 assume !(0 != eval_~tmp___0~0); 2434#L303 start_simulation_~kernel_st~0 := 2; 2494#L204-2 assume !(1 == ~b0_req_up~0); 2497#L204-3 assume !(1 == ~b1_req_up~0); 2540#L211-1 assume !(1 == ~d0_req_up~0); 2534#L218-1 assume !(1 == ~d1_req_up~0); 2528#L225-1 assume !(1 == ~z_req_up~0); 2525#L232-1 start_simulation_~kernel_st~0 := 3; 2523#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2521#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2430#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2431#L323-3 assume !(0 == ~d1_ev~0); 2462#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2492#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2503#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2436#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2476#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2477#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2507#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2508#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2428#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2429#L356-3 assume !(1 == ~d1_ev~0); 2459#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2491#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 2445#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2446#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2467#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2468#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2441#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2442#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2478#L441 assume !(0 != start_simulation_~tmp~3); 2479#L424-1 [2020-10-20 08:02:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1986798985, now seen corresponding path program 1 times [2020-10-20 08:02:10,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896254809] [2020-10-20 08:02:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896254809] [2020-10-20 08:02:10,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:10,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377096044] [2020-10-20 08:02:10,183 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 11 times [2020-10-20 08:02:10,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239951591] [2020-10-20 08:02:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239951591] [2020-10-20 08:02:10,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291408859] [2020-10-20 08:02:10,224 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:10,225 INFO L87 Difference]: Start difference. First operand 141 states and 218 transitions. cyclomatic complexity: 78 Second operand 3 states. [2020-10-20 08:02:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,264 INFO L93 Difference]: Finished difference Result 180 states and 275 transitions. [2020-10-20 08:02:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:10,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 275 transitions. [2020-10-20 08:02:10,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2020-10-20 08:02:10,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 275 transitions. [2020-10-20 08:02:10,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2020-10-20 08:02:10,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2020-10-20 08:02:10,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 275 transitions. [2020-10-20 08:02:10,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,268 INFO L691 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2020-10-20 08:02:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 275 transitions. [2020-10-20 08:02:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2020-10-20 08:02:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-20 08:02:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2020-10-20 08:02:10,273 INFO L714 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2020-10-20 08:02:10,273 INFO L594 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2020-10-20 08:02:10,273 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:02:10,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 275 transitions. [2020-10-20 08:02:10,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2020-10-20 08:02:10,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:10,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:10,275 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:10,276 INFO L853 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, 1] [2020-10-20 08:02:10,276 INFO L794 eck$LassoCheckResult]: Stem: 2835#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2746#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2747#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2826#L204 assume 1 == ~b0_req_up~0; 2830#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2844#L129-2 ~b0_req_up~0 := 0; 2829#L204-1 assume 1 == ~b1_req_up~0; 2783#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2784#L144-2 ~b1_req_up~0 := 0; 2804#L211 assume 1 == ~d0_req_up~0; 2855#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2843#L159-2 ~d0_req_up~0 := 0; 2808#L218 assume 1 == ~d1_req_up~0; 2809#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2818#L174-2 ~d1_req_up~0 := 0; 2819#L225 assume !(1 == ~z_req_up~0); 2790#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2791#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2850#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2753#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2754#L323-1 assume !(0 == ~d1_ev~0); 2786#L328-1 assume !(0 == ~z_ev~0); 2820#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2832#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2769#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2781#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2782#L382 assume !(0 != activate_threads_~tmp~1); 2845#L382-2 assume !(1 == ~b0_ev~0); 2846#L346-1 assume !(1 == ~b1_ev~0); 2751#L351-1 assume !(1 == ~d0_ev~0); 2752#L356-1 assume !(1 == ~d1_ev~0); 2785#L361-1 assume !(1 == ~z_ev~0); 2811#L424-1 [2020-10-20 08:02:10,276 INFO L796 eck$LassoCheckResult]: Loop: 2811#L424-1 assume !false; 2773#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 2774#L287 assume !false; 2815#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2778#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2779#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2799#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2762#L282 assume !(0 != eval_~tmp___0~0); 2764#L303 start_simulation_~kernel_st~0 := 2; 2825#L204-2 assume !(1 == ~b0_req_up~0); 2828#L204-3 assume !(1 == ~b1_req_up~0); 2898#L211-1 assume !(1 == ~d0_req_up~0); 2875#L218-1 assume !(1 == ~d1_req_up~0); 2873#L225-1 assume !(1 == ~z_req_up~0); 2868#L232-1 start_simulation_~kernel_st~0 := 3; 2865#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2862#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2861#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2761#L323-3 assume !(0 == ~d1_ev~0); 2792#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2822#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 2834#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2766#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2806#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2807#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2838#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2839#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2758#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2759#L356-3 assume !(1 == ~d1_ev~0); 2789#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2821#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 2775#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2776#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2797#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2798#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2771#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2772#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2810#L441 assume !(0 != start_simulation_~tmp~3); 2811#L424-1 [2020-10-20 08:02:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1399992971, now seen corresponding path program 1 times [2020-10-20 08:02:10,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804745604] [2020-10-20 08:02:10,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804745604] [2020-10-20 08:02:10,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:10,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157722416] [2020-10-20 08:02:10,297 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 12 times [2020-10-20 08:02:10,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734808393] [2020-10-20 08:02:10,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734808393] [2020-10-20 08:02:10,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111791690] [2020-10-20 08:02:10,321 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:10,322 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. cyclomatic complexity: 96 Second operand 3 states. [2020-10-20 08:02:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,347 INFO L93 Difference]: Finished difference Result 235 states and 352 transitions. [2020-10-20 08:02:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:10,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 352 transitions. [2020-10-20 08:02:10,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2020-10-20 08:02:10,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 235 states and 352 transitions. [2020-10-20 08:02:10,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2020-10-20 08:02:10,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2020-10-20 08:02:10,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 352 transitions. [2020-10-20 08:02:10,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,353 INFO L691 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2020-10-20 08:02:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 352 transitions. [2020-10-20 08:02:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2020-10-20 08:02:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-10-20 08:02:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 352 transitions. [2020-10-20 08:02:10,358 INFO L714 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2020-10-20 08:02:10,358 INFO L594 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2020-10-20 08:02:10,358 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 08:02:10,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 352 transitions. [2020-10-20 08:02:10,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2020-10-20 08:02:10,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:10,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:10,361 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:10,361 INFO L853 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, 1] [2020-10-20 08:02:10,362 INFO L794 eck$LassoCheckResult]: Stem: 3262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3170#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 3171#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 3253#L204 assume 1 == ~b0_req_up~0; 3257#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 3270#L129-2 ~b0_req_up~0 := 0; 3256#L204-1 assume 1 == ~b1_req_up~0; 3207#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 3208#L144-2 ~b1_req_up~0 := 0; 3229#L211 assume 1 == ~d0_req_up~0; 3280#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 3269#L159-2 ~d0_req_up~0 := 0; 3234#L218 assume 1 == ~d1_req_up~0; 3235#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 3244#L174-2 ~d1_req_up~0 := 0; 3245#L225 assume !(1 == ~z_req_up~0); 3214#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 3215#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3276#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3177#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3178#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 3210#L328-1 assume !(0 == ~z_ev~0); 3246#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3259#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3193#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3205#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3206#L382 assume !(0 != activate_threads_~tmp~1); 3271#L382-2 assume !(1 == ~b0_ev~0); 3272#L346-1 assume !(1 == ~b1_ev~0); 3175#L351-1 assume !(1 == ~d0_ev~0); 3176#L356-1 assume !(1 == ~d1_ev~0); 3209#L361-1 assume !(1 == ~z_ev~0); 3233#L424-1 [2020-10-20 08:02:10,362 INFO L796 eck$LassoCheckResult]: Loop: 3233#L424-1 assume !false; 3197#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 3198#L287 assume !false; 3240#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 3202#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3203#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3223#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 3186#L282 assume !(0 != eval_~tmp___0~0); 3188#L303 start_simulation_~kernel_st~0 := 2; 3252#L204-2 assume !(1 == ~b0_req_up~0); 3255#L204-3 assume !(1 == ~b1_req_up~0); 3310#L211-1 assume !(1 == ~d0_req_up~0); 3304#L218-1 assume !(1 == ~d1_req_up~0); 3298#L225-1 assume !(1 == ~z_req_up~0); 3295#L232-1 start_simulation_~kernel_st~0 := 3; 3292#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3288#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3286#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3284#L323-3 assume !(0 == ~d1_ev~0); 3216#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 3248#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 3261#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3190#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3230#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3231#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 3264#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3265#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 3182#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 3183#L356-3 assume !(1 == ~d1_ev~0); 3213#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 3247#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 3199#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3200#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3219#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 3220#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3195#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 3196#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 3232#L441 assume !(0 != start_simulation_~tmp~3); 3233#L424-1 [2020-10-20 08:02:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1658158409, now seen corresponding path program 1 times [2020-10-20 08:02:10,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969128634] [2020-10-20 08:02:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969128634] [2020-10-20 08:02:10,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 08:02:10,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234173053] [2020-10-20 08:02:10,424 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 13 times [2020-10-20 08:02:10,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839389106] [2020-10-20 08:02:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839389106] [2020-10-20 08:02:10,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171028272] [2020-10-20 08:02:10,448 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:02:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:02:10,449 INFO L87 Difference]: Start difference. First operand 235 states and 352 transitions. cyclomatic complexity: 118 Second operand 6 states. [2020-10-20 08:02:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,538 INFO L93 Difference]: Finished difference Result 633 states and 958 transitions. [2020-10-20 08:02:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:02:10,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 633 states and 958 transitions. [2020-10-20 08:02:10,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 583 [2020-10-20 08:02:10,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 633 states to 633 states and 958 transitions. [2020-10-20 08:02:10,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 633 [2020-10-20 08:02:10,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 633 [2020-10-20 08:02:10,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 633 states and 958 transitions. [2020-10-20 08:02:10,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,555 INFO L691 BuchiCegarLoop]: Abstraction has 633 states and 958 transitions. [2020-10-20 08:02:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states and 958 transitions. [2020-10-20 08:02:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 241. [2020-10-20 08:02:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-20 08:02:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 358 transitions. [2020-10-20 08:02:10,565 INFO L714 BuchiCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-10-20 08:02:10,565 INFO L594 BuchiCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-10-20 08:02:10,565 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 08:02:10,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 358 transitions. [2020-10-20 08:02:10,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 201 [2020-10-20 08:02:10,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:10,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:10,569 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:10,570 INFO L853 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, 1] [2020-10-20 08:02:10,570 INFO L794 eck$LassoCheckResult]: Stem: 4148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 4054#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 4055#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4139#L204 assume 1 == ~b0_req_up~0; 4143#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4158#L129-2 ~b0_req_up~0 := 0; 4142#L204-1 assume 1 == ~b1_req_up~0; 4092#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4093#L144-2 ~b1_req_up~0 := 0; 4113#L211 assume 1 == ~d0_req_up~0; 4171#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4157#L159-2 ~d0_req_up~0 := 0; 4118#L218 assume 1 == ~d1_req_up~0; 4119#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4130#L174-2 ~d1_req_up~0 := 0; 4131#L225 assume !(1 == ~z_req_up~0); 4099#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4100#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4166#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4061#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4062#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4095#L328-1 assume !(0 == ~z_ev~0); 4132#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4145#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4077#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4151#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4159#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4160#L382-2 assume !(1 == ~b0_ev~0); 4161#L346-1 assume !(1 == ~b1_ev~0); 4059#L351-1 assume !(1 == ~d0_ev~0); 4060#L356-1 assume !(1 == ~d1_ev~0); 4094#L361-1 assume !(1 == ~z_ev~0); 4121#L424-1 [2020-10-20 08:02:10,570 INFO L796 eck$LassoCheckResult]: Loop: 4121#L424-1 assume !false; 4081#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 4082#L287 assume !false; 4126#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4086#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4087#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4108#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 4070#L282 assume !(0 != eval_~tmp___0~0); 4072#L303 start_simulation_~kernel_st~0 := 2; 4138#L204-2 assume !(1 == ~b0_req_up~0); 4141#L204-3 assume !(1 == ~b1_req_up~0); 4202#L211-1 assume !(1 == ~d0_req_up~0); 4196#L218-1 assume !(1 == ~d1_req_up~0); 4190#L225-1 assume !(1 == ~z_req_up~0); 4187#L232-1 start_simulation_~kernel_st~0 := 3; 4184#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4180#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4178#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4176#L323-3 assume !(0 == ~d1_ev~0); 4101#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 4134#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4147#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4074#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4150#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4162#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4153#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4154#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4066#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4067#L356-3 assume !(1 == ~d1_ev~0); 4098#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4133#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 4083#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4084#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4106#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 4107#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4079#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 4080#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 4120#L441 assume !(0 != start_simulation_~tmp~3); 4121#L424-1 [2020-10-20 08:02:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1715416711, now seen corresponding path program 1 times [2020-10-20 08:02:10,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156291113] [2020-10-20 08:02:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156291113] [2020-10-20 08:02:10,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:10,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328306730] [2020-10-20 08:02:10,593 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 14 times [2020-10-20 08:02:10,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129980393] [2020-10-20 08:02:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129980393] [2020-10-20 08:02:10,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943521272] [2020-10-20 08:02:10,631 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:10,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:10,632 INFO L87 Difference]: Start difference. First operand 241 states and 358 transitions. cyclomatic complexity: 118 Second operand 3 states. [2020-10-20 08:02:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,664 INFO L93 Difference]: Finished difference Result 256 states and 375 transitions. [2020-10-20 08:02:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:10,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 375 transitions. [2020-10-20 08:02:10,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2020-10-20 08:02:10,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 256 states and 375 transitions. [2020-10-20 08:02:10,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2020-10-20 08:02:10,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2020-10-20 08:02:10,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 375 transitions. [2020-10-20 08:02:10,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,672 INFO L691 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2020-10-20 08:02:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 375 transitions. [2020-10-20 08:02:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2020-10-20 08:02:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-20 08:02:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2020-10-20 08:02:10,677 INFO L714 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2020-10-20 08:02:10,678 INFO L594 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2020-10-20 08:02:10,678 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 08:02:10,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 375 transitions. [2020-10-20 08:02:10,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2020-10-20 08:02:10,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:10,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:10,682 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:10,682 INFO L853 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, 1] [2020-10-20 08:02:10,683 INFO L794 eck$LassoCheckResult]: Stem: 4649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 4560#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 4561#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4640#L204 assume 1 == ~b0_req_up~0; 4644#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4661#L129-2 ~b0_req_up~0 := 0; 4643#L204-1 assume 1 == ~b1_req_up~0; 4593#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4594#L144-2 ~b1_req_up~0 := 0; 4615#L211 assume 1 == ~d0_req_up~0; 4672#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4660#L159-2 ~d0_req_up~0 := 0; 4620#L218 assume 1 == ~d1_req_up~0; 4621#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4632#L174-2 ~d1_req_up~0 := 0; 4633#L225 assume !(1 == ~z_req_up~0); 4600#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4601#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4667#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4567#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4568#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4596#L328-1 assume !(0 == ~z_ev~0); 4634#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4646#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4653#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4591#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4592#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4662#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4663#L346-1 assume !(1 == ~b1_ev~0); 4565#L351-1 assume !(1 == ~d0_ev~0); 4566#L356-1 assume !(1 == ~d1_ev~0); 4595#L361-1 assume !(1 == ~z_ev~0); 4623#L424-1 [2020-10-20 08:02:10,683 INFO L796 eck$LassoCheckResult]: Loop: 4623#L424-1 assume !false; 4584#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 4585#L287 assume !false; 4628#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4589#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4590#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4609#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 4576#L282 assume !(0 != eval_~tmp___0~0); 4578#L303 start_simulation_~kernel_st~0 := 2; 4639#L204-2 assume !(1 == ~b0_req_up~0); 4642#L204-3 assume !(1 == ~b1_req_up~0); 4723#L211-1 assume !(1 == ~d0_req_up~0); 4719#L218-1 assume !(1 == ~d1_req_up~0); 4714#L225-1 assume !(1 == ~z_req_up~0); 4708#L232-1 start_simulation_~kernel_st~0 := 3; 4706#L313-2 assume !(0 == ~b0_ev~0); 4705#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4703#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4701#L323-3 assume !(0 == ~d1_ev~0); 4602#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 4636#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 4648#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4652#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4618#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4619#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4655#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4656#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4572#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4573#L356-3 assume !(1 == ~d1_ev~0); 4599#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4635#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 4586#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4587#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4607#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 4608#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4582#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 4583#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 4622#L441 assume !(0 != start_simulation_~tmp~3); 4623#L424-1 [2020-10-20 08:02:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1717263753, now seen corresponding path program 1 times [2020-10-20 08:02:10,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252841165] [2020-10-20 08:02:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252841165] [2020-10-20 08:02:10,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:10,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237889049] [2020-10-20 08:02:10,708 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash 763502474, now seen corresponding path program 1 times [2020-10-20 08:02:10,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752710985] [2020-10-20 08:02:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752710985] [2020-10-20 08:02:10,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928144668] [2020-10-20 08:02:10,737 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:10,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:10,738 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. cyclomatic complexity: 120 Second operand 3 states. [2020-10-20 08:02:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,766 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2020-10-20 08:02:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:10,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 412 transitions. [2020-10-20 08:02:10,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2020-10-20 08:02:10,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 284 states and 412 transitions. [2020-10-20 08:02:10,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2020-10-20 08:02:10,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2020-10-20 08:02:10,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 412 transitions. [2020-10-20 08:02:10,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,773 INFO L691 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2020-10-20 08:02:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 412 transitions. [2020-10-20 08:02:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2020-10-20 08:02:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-10-20 08:02:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions. [2020-10-20 08:02:10,779 INFO L714 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2020-10-20 08:02:10,779 INFO L594 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2020-10-20 08:02:10,780 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 08:02:10,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 412 transitions. [2020-10-20 08:02:10,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2020-10-20 08:02:10,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:10,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:10,783 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:10,783 INFO L853 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, 1] [2020-10-20 08:02:10,783 INFO L794 eck$LassoCheckResult]: Stem: 5195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 5109#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 5110#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5186#L204 assume 1 == ~b0_req_up~0; 5190#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 5206#L129-2 ~b0_req_up~0 := 0; 5189#L204-1 assume 1 == ~b1_req_up~0; 5141#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 5142#L144-2 ~b1_req_up~0 := 0; 5162#L211 assume 1 == ~d0_req_up~0; 5217#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 5205#L159-2 ~d0_req_up~0 := 0; 5168#L218 assume 1 == ~d1_req_up~0; 5169#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 5179#L174-2 ~d1_req_up~0 := 0; 5180#L225 assume !(1 == ~z_req_up~0); 5148#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 5149#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 5214#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 5116#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5117#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 5144#L328-1 assume !(0 == ~z_ev~0); 5181#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5192#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5199#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5139#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5140#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5208#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5209#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5114#L351-1 assume !(1 == ~d0_ev~0); 5115#L356-1 assume !(1 == ~d1_ev~0); 5143#L361-1 assume !(1 == ~z_ev~0); 5171#L424-1 [2020-10-20 08:02:10,783 INFO L796 eck$LassoCheckResult]: Loop: 5171#L424-1 assume !false; 5132#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 5133#L287 assume !false; 5176#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5137#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5138#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5157#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 5125#L282 assume !(0 != eval_~tmp___0~0); 5127#L303 start_simulation_~kernel_st~0 := 2; 5185#L204-2 assume !(1 == ~b0_req_up~0); 5188#L204-3 assume !(1 == ~b1_req_up~0); 5293#L211-1 assume !(1 == ~d0_req_up~0); 5265#L218-1 assume !(1 == ~d1_req_up~0); 5260#L225-1 assume !(1 == ~z_req_up~0); 5257#L232-1 start_simulation_~kernel_st~0 := 3; 5241#L313-2 assume !(0 == ~b0_ev~0); 5235#L313-4 assume !(0 == ~b1_ev~0); 5232#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5228#L323-3 assume !(0 == ~d1_ev~0); 5226#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 5223#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5222#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5198#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5329#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5327#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5324#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5323#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5121#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5122#L356-3 assume !(1 == ~d1_ev~0); 5147#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 5182#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 5134#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5135#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5155#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 5156#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5130#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 5131#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 5170#L441 assume !(0 != start_simulation_~tmp~3); 5171#L424-1 [2020-10-20 08:02:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1717323335, now seen corresponding path program 1 times [2020-10-20 08:02:10,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118938368] [2020-10-20 08:02:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118938368] [2020-10-20 08:02:10,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:10,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251406727] [2020-10-20 08:02:10,805 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash 982357192, now seen corresponding path program 1 times [2020-10-20 08:02:10,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:10,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541436794] [2020-10-20 08:02:10,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:10,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541436794] [2020-10-20 08:02:10,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:10,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:10,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518254328] [2020-10-20 08:02:10,954 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:10,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:10,954 INFO L87 Difference]: Start difference. First operand 284 states and 412 transitions. cyclomatic complexity: 129 Second operand 3 states. [2020-10-20 08:02:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:10,983 INFO L93 Difference]: Finished difference Result 326 states and 467 transitions. [2020-10-20 08:02:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:10,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 467 transitions. [2020-10-20 08:02:10,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 292 [2020-10-20 08:02:10,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 326 states and 467 transitions. [2020-10-20 08:02:10,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2020-10-20 08:02:10,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2020-10-20 08:02:10,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 326 states and 467 transitions. [2020-10-20 08:02:10,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:10,992 INFO L691 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2020-10-20 08:02:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 467 transitions. [2020-10-20 08:02:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2020-10-20 08:02:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-10-20 08:02:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 467 transitions. [2020-10-20 08:02:10,998 INFO L714 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2020-10-20 08:02:10,998 INFO L594 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2020-10-20 08:02:10,998 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 08:02:10,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 467 transitions. [2020-10-20 08:02:11,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 292 [2020-10-20 08:02:11,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:11,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:11,001 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:11,001 INFO L853 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, 1] [2020-10-20 08:02:11,002 INFO L794 eck$LassoCheckResult]: Stem: 5816#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 5728#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 5729#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5807#L204 assume 1 == ~b0_req_up~0; 5811#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 5827#L129-2 ~b0_req_up~0 := 0; 5810#L204-1 assume 1 == ~b1_req_up~0; 5760#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 5761#L144-2 ~b1_req_up~0 := 0; 5785#L211 assume 1 == ~d0_req_up~0; 5839#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 5826#L159-2 ~d0_req_up~0 := 0; 5790#L218 assume 1 == ~d1_req_up~0; 5791#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 5799#L174-2 ~d1_req_up~0 := 0; 5800#L225 assume !(1 == ~z_req_up~0); 5767#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 5768#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 5835#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 5735#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5736#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 5763#L328-1 assume !(0 == ~z_ev~0); 5801#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5813#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5820#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5758#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5759#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5830#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5831#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5733#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5734#L356-1 assume !(1 == ~d1_ev~0); 5762#L361-1 assume !(1 == ~z_ev~0); 5789#L424-1 [2020-10-20 08:02:11,002 INFO L796 eck$LassoCheckResult]: Loop: 5789#L424-1 assume !false; 5751#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 5752#L287 assume !false; 5796#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5756#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5757#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5777#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 5744#L282 assume !(0 != eval_~tmp___0~0); 5746#L303 start_simulation_~kernel_st~0 := 2; 5806#L204-2 assume !(1 == ~b0_req_up~0); 5809#L204-3 assume !(1 == ~b1_req_up~0); 5894#L211-1 assume !(1 == ~d0_req_up~0); 5892#L218-1 assume !(1 == ~d1_req_up~0); 5890#L225-1 assume !(1 == ~z_req_up~0); 5886#L232-1 start_simulation_~kernel_st~0 := 3; 5883#L313-2 assume !(0 == ~b0_ev~0); 5878#L313-4 assume !(0 == ~b1_ev~0); 5875#L318-3 assume !(0 == ~d0_ev~0); 5866#L323-3 assume !(0 == ~d1_ev~0); 5865#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 5864#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 5861#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5862#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5918#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5916#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5845#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5844#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5842#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5741#L356-3 assume !(1 == ~d1_ev~0); 5766#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 5802#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 5753#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5754#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5773#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 5774#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5749#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 5750#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 5788#L441 assume !(0 != start_simulation_~tmp~3); 5789#L424-1 [2020-10-20 08:02:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325257, now seen corresponding path program 1 times [2020-10-20 08:02:11,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:11,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527774745] [2020-10-20 08:02:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:11,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527774745] [2020-10-20 08:02:11,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:11,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:11,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801772230] [2020-10-20 08:02:11,022 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1405059018, now seen corresponding path program 1 times [2020-10-20 08:02:11,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:11,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921459139] [2020-10-20 08:02:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:11,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921459139] [2020-10-20 08:02:11,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:11,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:11,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106155832] [2020-10-20 08:02:11,044 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:11,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:11,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:11,045 INFO L87 Difference]: Start difference. First operand 326 states and 467 transitions. cyclomatic complexity: 142 Second operand 3 states. [2020-10-20 08:02:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:11,071 INFO L93 Difference]: Finished difference Result 393 states and 555 transitions. [2020-10-20 08:02:11,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:11,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 555 transitions. [2020-10-20 08:02:11,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2020-10-20 08:02:11,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 393 states and 555 transitions. [2020-10-20 08:02:11,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2020-10-20 08:02:11,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 393 [2020-10-20 08:02:11,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 393 states and 555 transitions. [2020-10-20 08:02:11,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:11,080 INFO L691 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2020-10-20 08:02:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states and 555 transitions. [2020-10-20 08:02:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2020-10-20 08:02:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2020-10-20 08:02:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 555 transitions. [2020-10-20 08:02:11,087 INFO L714 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2020-10-20 08:02:11,087 INFO L594 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2020-10-20 08:02:11,087 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 08:02:11,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 555 transitions. [2020-10-20 08:02:11,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2020-10-20 08:02:11,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:11,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:11,091 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:11,092 INFO L853 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, 1] [2020-10-20 08:02:11,092 INFO L794 eck$LassoCheckResult]: Stem: 6544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 6456#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 6457#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6534#L204 assume 1 == ~b0_req_up~0; 6538#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 6556#L129-2 ~b0_req_up~0 := 0; 6537#L204-1 assume 1 == ~b1_req_up~0; 6488#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 6489#L144-2 ~b1_req_up~0 := 0; 6511#L211 assume 1 == ~d0_req_up~0; 6569#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 6555#L159-2 ~d0_req_up~0 := 0; 6516#L218 assume 1 == ~d1_req_up~0; 6517#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 6526#L174-2 ~d1_req_up~0 := 0; 6527#L225 assume !(1 == ~z_req_up~0); 6495#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 6496#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 6564#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 6463#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 6464#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 6491#L328-1 assume !(0 == ~z_ev~0); 6528#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 6540#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6548#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6486#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6487#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6559#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6560#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6461#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6462#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 6490#L361-1 assume !(1 == ~z_ev~0); 6515#L424-1 [2020-10-20 08:02:11,092 INFO L796 eck$LassoCheckResult]: Loop: 6515#L424-1 assume !false; 6479#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 6480#L287 assume !false; 6522#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 6484#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6485#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6504#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 6472#L282 assume !(0 != eval_~tmp___0~0); 6474#L303 start_simulation_~kernel_st~0 := 2; 6533#L204-2 assume !(1 == ~b0_req_up~0); 6536#L204-3 assume !(1 == ~b1_req_up~0); 6626#L211-1 assume !(1 == ~d0_req_up~0); 6623#L218-1 assume !(1 == ~d1_req_up~0); 6619#L225-1 assume !(1 == ~z_req_up~0); 6616#L232-1 start_simulation_~kernel_st~0 := 3; 6613#L313-2 assume !(0 == ~b0_ev~0); 6610#L313-4 assume !(0 == ~b1_ev~0); 6608#L318-3 assume !(0 == ~d0_ev~0); 6606#L323-3 assume !(0 == ~d1_ev~0); 6604#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 6602#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 6598#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6599#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6646#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6644#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6580#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6577#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6575#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6573#L356-3 assume !(1 == ~d1_ev~0); 6494#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 6529#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 6481#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6482#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6500#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 6501#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6477#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 6478#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 6514#L441 assume !(0 != start_simulation_~tmp~3); 6515#L424-1 [2020-10-20 08:02:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 1 times [2020-10-20 08:02:11,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:11,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627950012] [2020-10-20 08:02:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:11,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:11,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:11,141 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1405059018, now seen corresponding path program 2 times [2020-10-20 08:02:11,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:11,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683119157] [2020-10-20 08:02:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:11,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683119157] [2020-10-20 08:02:11,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:11,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:02:11,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929790216] [2020-10-20 08:02:11,190 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:11,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:11,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:02:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:02:11,190 INFO L87 Difference]: Start difference. First operand 393 states and 555 transitions. cyclomatic complexity: 163 Second operand 5 states. [2020-10-20 08:02:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:11,261 INFO L93 Difference]: Finished difference Result 426 states and 602 transitions. [2020-10-20 08:02:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:02:11,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 602 transitions. [2020-10-20 08:02:11,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 392 [2020-10-20 08:02:11,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 426 states and 602 transitions. [2020-10-20 08:02:11,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 426 [2020-10-20 08:02:11,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426 [2020-10-20 08:02:11,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 602 transitions. [2020-10-20 08:02:11,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:02:11,270 INFO L691 BuchiCegarLoop]: Abstraction has 426 states and 602 transitions. [2020-10-20 08:02:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 602 transitions. [2020-10-20 08:02:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2020-10-20 08:02:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-10-20 08:02:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 558 transitions. [2020-10-20 08:02:11,278 INFO L714 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2020-10-20 08:02:11,278 INFO L594 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2020-10-20 08:02:11,278 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 08:02:11,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 558 transitions. [2020-10-20 08:02:11,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 362 [2020-10-20 08:02:11,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:11,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:11,282 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:11,282 INFO L853 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, 1] [2020-10-20 08:02:11,283 INFO L794 eck$LassoCheckResult]: Stem: 7380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 7291#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 7292#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 7371#L204 assume 1 == ~b0_req_up~0; 7375#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 7391#L129-2 ~b0_req_up~0 := 0; 7374#L204-1 assume 1 == ~b1_req_up~0; 7323#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 7324#L144-2 ~b1_req_up~0 := 0; 7346#L211 assume 1 == ~d0_req_up~0; 7403#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 7390#L159-2 ~d0_req_up~0 := 0; 7351#L218 assume 1 == ~d1_req_up~0; 7352#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 7361#L174-2 ~d1_req_up~0 := 0; 7362#L225 assume !(1 == ~z_req_up~0); 7330#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 7331#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 7399#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 7298#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7299#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 7326#L328-1 assume !(0 == ~z_ev~0); 7363#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 7377#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7384#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7321#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 7322#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7394#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7395#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7296#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7297#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 7325#L361-1 assume !(1 == ~z_ev~0); 7350#L424-1 [2020-10-20 08:02:11,283 INFO L796 eck$LassoCheckResult]: Loop: 7350#L424-1 assume !false; 7313#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 7314#L287 assume !false; 7357#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 7318#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 7320#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7381#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 7537#L282 assume !(0 != eval_~tmp___0~0); 7369#L303 start_simulation_~kernel_st~0 := 2; 7370#L204-2 assume !(1 == ~b0_req_up~0); 7373#L204-3 assume !(1 == ~b1_req_up~0); 7488#L211-1 assume !(1 == ~d0_req_up~0); 7481#L218-1 assume !(1 == ~d1_req_up~0); 7475#L225-1 assume !(1 == ~z_req_up~0); 7472#L232-1 start_simulation_~kernel_st~0 := 3; 7467#L313-2 assume !(0 == ~b0_ev~0); 7461#L313-4 assume !(0 == ~b1_ev~0); 7458#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7456#L323-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 7457#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 7643#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 7644#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7595#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7593#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 7591#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7588#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7585#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7303#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7304#L356-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 7329#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 7364#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 7315#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 7316#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7335#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 7336#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7311#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 7312#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 7349#L441 assume !(0 != start_simulation_~tmp~3); 7350#L424-1 [2020-10-20 08:02:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 2 times [2020-10-20 08:02:11,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:11,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031143] [2020-10-20 08:02:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:11,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:11,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:11,326 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -50950646, now seen corresponding path program 1 times [2020-10-20 08:02:11,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:11,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126222786] [2020-10-20 08:02:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:11,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:11,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:11,346 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1472395774, now seen corresponding path program 1 times [2020-10-20 08:02:11,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:11,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85478560] [2020-10-20 08:02:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:11,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85478560] [2020-10-20 08:02:11,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:11,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:11,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166183276] [2020-10-20 08:02:11,643 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2020-10-20 08:02:11,781 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:02:11,782 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:02:11,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:02:11,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:02:11,783 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:02:11,783 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:11,783 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:02:11,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:02:11,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration20_Loop [2020-10-20 08:02:11,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:02:11,784 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:02:11,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:11,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,241 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:02:12,243 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:12,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:12,250 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:12,267 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:12,267 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:12,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:12,312 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:12,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:02:12,363 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:12,375 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:02:12,408 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:02:12,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:02:12,408 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:02:12,408 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:02:12,408 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:02:12,408 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:12,408 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:02:12,408 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:02:12,408 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration20_Loop [2020-10-20 08:02:12,408 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:02:12,409 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:02:12,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:12,818 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:02:12,824 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:12,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:12,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:12,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:12,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:12,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:12,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:12,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:12,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:12,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:12,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:12,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:12,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:12,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:12,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:12,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:12,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:12,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:12,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:12,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:12,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:12,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:12,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:12,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:12,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:12,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:12,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:12,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:13,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:13,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:13,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:13,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:13,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:13,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:13,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:13,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:13,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:13,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:13,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:13,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:13,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:13,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:13,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:13,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:13,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:13,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:02:13,068 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:02:13,068 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:13,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:02:13,082 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:02:13,082 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:02:13,083 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b0_ev~0) = -2*~b0_ev~0 + 3 Supporting invariants [] Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:13,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:02:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:13,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:02:13,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:02:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:13,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:02:13,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:02:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:13,377 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:02:13,378 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163 Second operand 5 states. [2020-10-20 08:02:13,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163. Second operand 5 states. Result 1350 states and 1928 transitions. Complement of second has 7 states. [2020-10-20 08:02:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:02:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:02:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2020-10-20 08:02:13,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 256 transitions. Stem has 32 letters. Loop has 38 letters. [2020-10-20 08:02:13,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:02:13,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 256 transitions. Stem has 70 letters. Loop has 38 letters. [2020-10-20 08:02:13,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:02:13,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 256 transitions. Stem has 32 letters. Loop has 76 letters. [2020-10-20 08:02:13,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:02:13,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1350 states and 1928 transitions. [2020-10-20 08:02:13,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 937 [2020-10-20 08:02:13,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1350 states to 1278 states and 1828 transitions. [2020-10-20 08:02:13,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 972 [2020-10-20 08:02:13,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 977 [2020-10-20 08:02:13,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1278 states and 1828 transitions. [2020-10-20 08:02:13,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:13,516 INFO L691 BuchiCegarLoop]: Abstraction has 1278 states and 1828 transitions. [2020-10-20 08:02:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states and 1828 transitions. [2020-10-20 08:02:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 911. [2020-10-20 08:02:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2020-10-20 08:02:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1301 transitions. [2020-10-20 08:02:13,535 INFO L714 BuchiCegarLoop]: Abstraction has 911 states and 1301 transitions. [2020-10-20 08:02:13,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:13,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:13,536 INFO L87 Difference]: Start difference. First operand 911 states and 1301 transitions. Second operand 3 states. [2020-10-20 08:02:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:13,580 INFO L93 Difference]: Finished difference Result 969 states and 1379 transitions. [2020-10-20 08:02:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:13,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 969 states and 1379 transitions. [2020-10-20 08:02:13,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2020-10-20 08:02:13,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 969 states to 969 states and 1379 transitions. [2020-10-20 08:02:13,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 648 [2020-10-20 08:02:13,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 648 [2020-10-20 08:02:13,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 969 states and 1379 transitions. [2020-10-20 08:02:13,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:13,597 INFO L691 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2020-10-20 08:02:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states and 1379 transitions. [2020-10-20 08:02:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2020-10-20 08:02:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2020-10-20 08:02:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1379 transitions. [2020-10-20 08:02:13,614 INFO L714 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2020-10-20 08:02:13,614 INFO L594 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2020-10-20 08:02:13,614 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 08:02:13,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 969 states and 1379 transitions. [2020-10-20 08:02:13,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2020-10-20 08:02:13,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:13,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:13,621 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:13,622 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:13,622 INFO L794 eck$LassoCheckResult]: Stem: 11317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 11160#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 11161#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 11299#L204 assume 1 == ~b0_req_up~0; 11306#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 11338#L129-2 ~b0_req_up~0 := 0; 11304#L204-1 assume 1 == ~b1_req_up~0; 11210#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 11211#L144-2 ~b1_req_up~0 := 0; 11252#L211 assume 1 == ~d0_req_up~0; 11362#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 11337#L159-2 ~d0_req_up~0 := 0; 11261#L218 assume 1 == ~d1_req_up~0; 11262#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 11283#L174-2 ~d1_req_up~0 := 0; 11284#L225 assume !(1 == ~z_req_up~0); 11221#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 11222#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 11352#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 11168#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 11169#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 11213#L328-1 assume !(0 == ~z_ev~0); 11285#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 11309#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11324#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 11208#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 11209#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11343#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11344#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11162#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11163#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 11212#L361-1 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11281#L424-1 [2020-10-20 08:02:13,622 INFO L796 eck$LassoCheckResult]: Loop: 11281#L424-1 assume !false; 11764#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 11368#L287 assume !false; 11763#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11762#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11416#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11761#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 11759#L282 assume 0 != eval_~tmp___0~0; 11201#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 11202#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 11319#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 11241#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 11275#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 11171#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 11336#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 11263#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 11264#L287 assume !false; 11418#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11415#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 11413#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11411#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 11384#L282 assume !(0 != eval_~tmp___0~0); 11295#L303 start_simulation_~kernel_st~0 := 2; 11296#L204-2 assume !(1 == ~b0_req_up~0); 11693#L204-3 assume !(1 == ~b1_req_up~0); 11688#L211-1 assume !(1 == ~d0_req_up~0); 11684#L218-1 assume !(1 == ~d1_req_up~0); 11679#L225-1 assume !(1 == ~z_req_up~0); 11675#L232-1 start_simulation_~kernel_st~0 := 3; 11671#L313-2 assume !(0 == ~b0_ev~0); 11668#L313-4 assume !(0 == ~b1_ev~0); 11665#L318-3 assume !(0 == ~d0_ev~0); 11662#L323-3 assume !(0 == ~d1_ev~0); 11659#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 11656#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 11655#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11633#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 11632#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 11631#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11618#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11615#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11614#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11773#L356-3 assume !(1 == ~d1_ev~0); 11772#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11771#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 11770#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11586#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11769#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 11768#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11767#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 11766#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 11765#L441 assume !(0 != start_simulation_~tmp~3); 11281#L424-1 [2020-10-20 08:02:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325321, now seen corresponding path program 1 times [2020-10-20 08:02:13,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:13,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918807334] [2020-10-20 08:02:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:13,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918807334] [2020-10-20 08:02:13,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:13,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:02:13,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123151429] [2020-10-20 08:02:13,661 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:02:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash -696899428, now seen corresponding path program 1 times [2020-10-20 08:02:13,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:13,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965031735] [2020-10-20 08:02:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:13,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965031735] [2020-10-20 08:02:13,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:13,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:13,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602439704] [2020-10-20 08:02:13,677 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:13,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:13,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:13,678 INFO L87 Difference]: Start difference. First operand 969 states and 1379 transitions. cyclomatic complexity: 413 Second operand 3 states. [2020-10-20 08:02:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:13,720 INFO L93 Difference]: Finished difference Result 1921 states and 2691 transitions. [2020-10-20 08:02:13,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:13,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1921 states and 2691 transitions. [2020-10-20 08:02:13,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2020-10-20 08:02:13,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1921 states to 1921 states and 2691 transitions. [2020-10-20 08:02:13,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2020-10-20 08:02:13,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2020-10-20 08:02:13,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1921 states and 2691 transitions. [2020-10-20 08:02:13,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:13,754 INFO L691 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2020-10-20 08:02:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states and 2691 transitions. [2020-10-20 08:02:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2020-10-20 08:02:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2020-10-20 08:02:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2691 transitions. [2020-10-20 08:02:13,789 INFO L714 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2020-10-20 08:02:13,789 INFO L594 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2020-10-20 08:02:13,789 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-20 08:02:13,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1921 states and 2691 transitions. [2020-10-20 08:02:13,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2020-10-20 08:02:13,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:13,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:13,802 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:13,803 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:13,803 INFO L794 eck$LassoCheckResult]: Stem: 14225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 14057#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 14058#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 14200#L204 assume 1 == ~b0_req_up~0; 14210#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 14252#L129-2 ~b0_req_up~0 := 0; 14206#L204-1 assume 1 == ~b1_req_up~0; 14106#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 14107#L144-2 ~b1_req_up~0 := 0; 14151#L211 assume 1 == ~d0_req_up~0; 14280#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 14251#L159-2 ~d0_req_up~0 := 0; 14160#L218 assume 1 == ~d1_req_up~0; 14161#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 14182#L174-2 ~d1_req_up~0 := 0; 14183#L225 assume !(1 == ~z_req_up~0); 14118#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 14119#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 14297#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 14295#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 14294#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 14184#L328-1 assume !(0 == ~z_ev~0); 14185#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 14213#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 14236#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 14104#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 14105#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 14257#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 14258#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 14541#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 14108#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 14109#L361-1 assume !(1 == ~z_ev~0); 14181#L424-1 assume !false; 14307#L425 [2020-10-20 08:02:13,803 INFO L796 eck$LassoCheckResult]: Loop: 14307#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 14855#L287 assume !false; 15081#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 15079#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 14853#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 15076#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 15075#L282 assume 0 != eval_~tmp___0~0; 15073#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 14857#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 15071#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 15064#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 15062#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 15061#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 15057#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 14162#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 14091#L287 assume !false; 14854#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 14852#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 14226#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 14227#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 14313#L282 assume !(0 != eval_~tmp___0~0); 15012#L303 start_simulation_~kernel_st~0 := 2; 14999#L204-2 assume !(1 == ~b0_req_up~0); 14986#L204-3 assume !(1 == ~b1_req_up~0); 14982#L211-1 assume !(1 == ~d0_req_up~0); 14979#L218-1 assume !(1 == ~d1_req_up~0); 14973#L225-1 assume !(1 == ~z_req_up~0); 14974#L232-1 start_simulation_~kernel_st~0 := 3; 15194#L313-2 assume !(0 == ~b0_ev~0); 15192#L313-4 assume !(0 == ~b1_ev~0); 15189#L318-3 assume !(0 == ~d0_ev~0); 15187#L323-3 assume !(0 == ~d1_ev~0); 15186#L328-3 assume !(0 == ~z_ev~0); 15184#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 15183#L99-1 assume !(1 == ~b0_ev~0); 15180#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 15181#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 15202#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 15201#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 15200#L382-5 assume !(1 == ~b0_ev~0); 15197#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 15196#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 14874#L356-3 assume !(1 == ~d1_ev~0); 14870#L361-3 assume !(1 == ~z_ev~0); 14866#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 14094#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 14095#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 14223#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 14861#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 14862#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 14249#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 14156#L441 assume !(0 != start_simulation_~tmp~3); 14157#L424-1 assume !false; 14307#L425 [2020-10-20 08:02:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 1 times [2020-10-20 08:02:13,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:13,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962279467] [2020-10-20 08:02:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:13,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:13,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:13,826 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:13,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash 100562712, now seen corresponding path program 1 times [2020-10-20 08:02:13,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:13,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771905493] [2020-10-20 08:02:13,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:13,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771905493] [2020-10-20 08:02:13,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:13,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:13,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735331967] [2020-10-20 08:02:13,858 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:13,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:13,859 INFO L87 Difference]: Start difference. First operand 1921 states and 2691 transitions. cyclomatic complexity: 773 Second operand 3 states. [2020-10-20 08:02:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:13,910 INFO L93 Difference]: Finished difference Result 3753 states and 5233 transitions. [2020-10-20 08:02:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:13,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3753 states and 5233 transitions. [2020-10-20 08:02:13,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2428 [2020-10-20 08:02:13,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3753 states to 3753 states and 5233 transitions. [2020-10-20 08:02:13,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2481 [2020-10-20 08:02:13,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2481 [2020-10-20 08:02:13,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3753 states and 5233 transitions. [2020-10-20 08:02:13,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:13,981 INFO L691 BuchiCegarLoop]: Abstraction has 3753 states and 5233 transitions. [2020-10-20 08:02:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states and 5233 transitions. [2020-10-20 08:02:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 1939. [2020-10-20 08:02:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2020-10-20 08:02:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2709 transitions. [2020-10-20 08:02:14,029 INFO L714 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2020-10-20 08:02:14,029 INFO L594 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2020-10-20 08:02:14,030 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-20 08:02:14,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1939 states and 2709 transitions. [2020-10-20 08:02:14,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1238 [2020-10-20 08:02:14,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:14,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:14,042 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:14,043 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:14,043 INFO L794 eck$LassoCheckResult]: Stem: 19910#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 19735#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 19736#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 19888#L204 assume 1 == ~b0_req_up~0; 19894#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 19939#L129-2 ~b0_req_up~0 := 0; 19893#L204-1 assume 1 == ~b1_req_up~0; 19787#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 19788#L144-2 ~b1_req_up~0 := 0; 19831#L211 assume 1 == ~d0_req_up~0; 19969#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 19938#L159-2 ~d0_req_up~0 := 0; 19840#L218 assume 1 == ~d1_req_up~0; 19841#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 19869#L174-2 ~d1_req_up~0 := 0; 19870#L225 assume !(1 == ~z_req_up~0); 19958#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 19972#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 19973#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 19980#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 19979#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 19871#L328-1 assume !(0 == ~z_ev~0); 19872#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 19920#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 19921#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 19785#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 19786#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 19945#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 19946#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 19737#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 19738#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 19867#L361-1 assume !(1 == ~z_ev~0); 19868#L424-1 assume !false; 20417#L425 [2020-10-20 08:02:14,043 INFO L796 eck$LassoCheckResult]: Loop: 20417#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 20730#L287 assume !false; 20805#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 20803#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 20712#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20737#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 20735#L282 assume 0 != eval_~tmp___0~0; 20732#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 20717#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 20729#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 20727#L44-1 assume 0 != ~d0_val~0; 20725#L54 assume 0 != ~b1_val~0;method1_~s2~0 := 0; 20723#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 20722#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 20720#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 20715#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 20714#L287 assume !false; 20713#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 20711#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 20710#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20709#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 20707#L282 assume !(0 != eval_~tmp___0~0); 20706#L303 start_simulation_~kernel_st~0 := 2; 20686#L204-2 assume !(1 == ~b0_req_up~0); 20680#L204-3 assume !(1 == ~b1_req_up~0); 20681#L211-1 assume !(1 == ~d0_req_up~0); 21030#L218-1 assume !(1 == ~d1_req_up~0); 21031#L225-1 assume !(1 == ~z_req_up~0); 21169#L232-1 start_simulation_~kernel_st~0 := 3; 21167#L313-2 assume !(0 == ~b0_ev~0); 21165#L313-4 assume !(0 == ~b1_ev~0); 21162#L318-3 assume !(0 == ~d0_ev~0); 21160#L323-3 assume !(0 == ~d1_ev~0); 21158#L328-3 assume !(0 == ~z_ev~0); 21156#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 21154#L99-1 assume !(1 == ~b0_ev~0); 21151#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 21152#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 21354#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 21351#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 21349#L382-5 assume !(1 == ~b0_ev~0); 21347#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 20949#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 20944#L356-3 assume !(1 == ~d1_ev~0); 20943#L361-3 assume !(1 == ~z_ev~0); 20872#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 20941#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 20860#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20940#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 20937#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 20880#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 20541#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 20542#L441 assume !(0 != start_simulation_~tmp~3); 20811#L424-1 assume !false; 20417#L425 [2020-10-20 08:02:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 2 times [2020-10-20 08:02:14,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:14,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111993485] [2020-10-20 08:02:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,067 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -614486231, now seen corresponding path program 1 times [2020-10-20 08:02:14,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:14,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872480610] [2020-10-20 08:02:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:14,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872480610] [2020-10-20 08:02:14,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:14,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:14,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768977114] [2020-10-20 08:02:14,086 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:14,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:14,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:14,086 INFO L87 Difference]: Start difference. First operand 1939 states and 2709 transitions. cyclomatic complexity: 773 Second operand 3 states. [2020-10-20 08:02:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:14,123 INFO L93 Difference]: Finished difference Result 3747 states and 5203 transitions. [2020-10-20 08:02:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:14,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3747 states and 5203 transitions. [2020-10-20 08:02:14,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2424 [2020-10-20 08:02:14,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3747 states to 3747 states and 5203 transitions. [2020-10-20 08:02:14,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2477 [2020-10-20 08:02:14,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2477 [2020-10-20 08:02:14,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3747 states and 5203 transitions. [2020-10-20 08:02:14,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:14,194 INFO L691 BuchiCegarLoop]: Abstraction has 3747 states and 5203 transitions. [2020-10-20 08:02:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states and 5203 transitions. [2020-10-20 08:02:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 1939. [2020-10-20 08:02:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2020-10-20 08:02:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2691 transitions. [2020-10-20 08:02:14,233 INFO L714 BuchiCegarLoop]: Abstraction has 1939 states and 2691 transitions. [2020-10-20 08:02:14,233 INFO L594 BuchiCegarLoop]: Abstraction has 1939 states and 2691 transitions. [2020-10-20 08:02:14,233 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-20 08:02:14,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1939 states and 2691 transitions. [2020-10-20 08:02:14,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1238 [2020-10-20 08:02:14,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:14,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:14,240 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:14,240 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:14,241 INFO L794 eck$LassoCheckResult]: Stem: 25609#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 25427#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 25428#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 25585#L204 assume 1 == ~b0_req_up~0; 25592#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 25643#L129-2 ~b0_req_up~0 := 0; 25590#L204-1 assume 1 == ~b1_req_up~0; 25479#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 25480#L144-2 ~b1_req_up~0 := 0; 25524#L211 assume 1 == ~d0_req_up~0; 25674#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 25642#L159-2 ~d0_req_up~0 := 0; 25533#L218 assume 1 == ~d1_req_up~0; 25534#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 25567#L174-2 ~d1_req_up~0 := 0; 25568#L225 assume !(1 == ~z_req_up~0); 25661#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 25679#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 25680#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 25689#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 25688#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 25569#L328-1 assume !(0 == ~z_ev~0); 25570#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 25595#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 25622#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 25623#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 25648#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 25649#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 25658#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 25659#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 25481#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 25482#L361-1 assume !(1 == ~z_ev~0); 25798#L424-1 assume !false; 25799#L425 [2020-10-20 08:02:14,241 INFO L796 eck$LassoCheckResult]: Loop: 25799#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 26496#L287 assume !false; 26501#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 26500#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 26468#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26499#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 26498#L282 assume 0 != eval_~tmp___0~0; 26497#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 26479#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 26495#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 26492#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 26490#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 26488#L65-2 assume 0 != method1_~s2~0; 26486#L72 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 26484#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 26477#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 26474#L287 assume !false; 26471#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 26467#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 26464#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26462#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 26460#L282 assume !(0 != eval_~tmp___0~0); 26458#L303 start_simulation_~kernel_st~0 := 2; 26453#L204-2 assume !(1 == ~b0_req_up~0); 26454#L204-3 assume !(1 == ~b1_req_up~0); 26451#L211-1 assume !(1 == ~d0_req_up~0); 26445#L218-1 assume !(1 == ~d1_req_up~0); 26440#L225-1 assume !(1 == ~z_req_up~0); 26435#L232-1 start_simulation_~kernel_st~0 := 3; 26433#L313-2 assume !(0 == ~b0_ev~0); 26426#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 26292#L318-3 assume !(0 == ~d0_ev~0); 26287#L323-3 assume !(0 == ~d1_ev~0); 26283#L328-3 assume !(0 == ~z_ev~0); 26280#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 26277#L99-1 assume !(1 == ~b0_ev~0); 26273#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 26271#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 26269#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 26267#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 26264#L382-5 assume !(1 == ~b0_ev~0); 26265#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 26259#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 26248#L356-3 assume !(1 == ~d1_ev~0); 26244#L361-3 assume !(1 == ~z_ev~0); 26243#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 26535#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 26531#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26527#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 26523#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 26519#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 26514#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 26510#L441 assume !(0 != start_simulation_~tmp~3); 26506#L424-1 assume !false; 25799#L425 [2020-10-20 08:02:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 3 times [2020-10-20 08:02:14,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:14,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17071078] [2020-10-20 08:02:14,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,260 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1673186692, now seen corresponding path program 1 times [2020-10-20 08:02:14,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:14,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233575443] [2020-10-20 08:02:14,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:14,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233575443] [2020-10-20 08:02:14,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:14,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:02:14,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948481976] [2020-10-20 08:02:14,276 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:02:14,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:02:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:02:14,276 INFO L87 Difference]: Start difference. First operand 1939 states and 2691 transitions. cyclomatic complexity: 755 Second operand 3 states. [2020-10-20 08:02:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:14,302 INFO L93 Difference]: Finished difference Result 2427 states and 3367 transitions. [2020-10-20 08:02:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:02:14,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2427 states and 3367 transitions. [2020-10-20 08:02:14,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1588 [2020-10-20 08:02:14,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2427 states to 2427 states and 3367 transitions. [2020-10-20 08:02:14,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1641 [2020-10-20 08:02:14,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1641 [2020-10-20 08:02:14,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2427 states and 3367 transitions. [2020-10-20 08:02:14,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:14,330 INFO L691 BuchiCegarLoop]: Abstraction has 2427 states and 3367 transitions. [2020-10-20 08:02:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states and 3367 transitions. [2020-10-20 08:02:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2295. [2020-10-20 08:02:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2020-10-20 08:02:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3187 transitions. [2020-10-20 08:02:14,366 INFO L714 BuchiCegarLoop]: Abstraction has 2295 states and 3187 transitions. [2020-10-20 08:02:14,366 INFO L594 BuchiCegarLoop]: Abstraction has 2295 states and 3187 transitions. [2020-10-20 08:02:14,367 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-20 08:02:14,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2295 states and 3187 transitions. [2020-10-20 08:02:14,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1500 [2020-10-20 08:02:14,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:14,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:14,376 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:14,376 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:14,376 INFO L794 eck$LassoCheckResult]: Stem: 29975#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 29799#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 29800#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 29955#L204 assume 1 == ~b0_req_up~0; 29960#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 30008#L129-2 ~b0_req_up~0 := 0; 29959#L204-1 assume 1 == ~b1_req_up~0; 29851#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 29852#L144-2 ~b1_req_up~0 := 0; 29896#L211 assume 1 == ~d0_req_up~0; 30041#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 30007#L159-2 ~d0_req_up~0 := 0; 29905#L218 assume 1 == ~d1_req_up~0; 29906#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 29934#L174-2 ~d1_req_up~0 := 0; 29935#L225 assume !(1 == ~z_req_up~0); 29864#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 29865#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 30028#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 30029#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 30051#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 29936#L328-1 assume !(0 == ~z_ev~0); 29937#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 29983#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 29984#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 29849#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 29850#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 30015#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 30016#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 29801#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 29802#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 29932#L361-1 assume !(1 == ~z_ev~0); 29933#L424-1 assume !false; 30664#L425 [2020-10-20 08:02:14,377 INFO L796 eck$LassoCheckResult]: Loop: 30664#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 32062#L287 assume !false; 32087#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 29845#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 29846#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 29976#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 32064#L282 assume 0 != eval_~tmp___0~0; 32063#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 30973#L291 assume 0 != eval_~tmp~0;~comp_m1_st~0 := 1;havoc method1_~s1~0, method1_~s2~0, method1_~s3~0;havoc method1_~s1~0;havoc method1_~s2~0;havoc method1_~s3~0; 32061#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 32059#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 32058#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 30697#L65-2 assume 0 != method1_~s2~0; 29911#L72 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 29912#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 29917#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 30974#L287 assume !false; 30971#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 30969#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 30967#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 30965#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 30962#L282 assume !(0 != eval_~tmp___0~0); 30959#L303 start_simulation_~kernel_st~0 := 2; 30942#L204-2 assume !(1 == ~b0_req_up~0); 30937#L204-3 assume !(1 == ~b1_req_up~0); 30938#L211-1 assume !(1 == ~d0_req_up~0); 30910#L218-1 assume !(1 == ~d1_req_up~0); 30908#L225-1 assume 1 == ~z_req_up~0; 30881#L189-3 assume !(~z_val~0 != ~z_val_t~0); 30879#L189-5 ~z_req_up~0 := 0; 30872#L232-1 start_simulation_~kernel_st~0 := 3; 30867#L313-2 assume !(0 == ~b0_ev~0); 30862#L313-4 assume !(0 == ~b1_ev~0); 30854#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 30850#L323-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 30773#L328-3 assume !(0 == ~z_ev~0); 30765#L333-3 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 30766#L99-1 assume !(1 == ~b0_ev~0); 31421#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 30735#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 30733#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 30731#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 30729#L382-5 assume !(1 == ~b0_ev~0); 30723#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 30712#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 30713#L356-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 29938#L361-3 assume !(1 == ~z_ev~0); 29939#L366-3 havoc stop_simulation_#res;havoc stop_simulation_#t~ret10, 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~1;havoc exists_runnable_thread_~__retres1~1; 29966#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 30983#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 29873#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 29874#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 29830#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 29831#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 32089#L441 assume !(0 != start_simulation_~tmp~3); 32088#L424-1 assume !false; 30664#L425 [2020-10-20 08:02:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 4 times [2020-10-20 08:02:14,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:14,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944333226] [2020-10-20 08:02:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,397 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash -677586128, now seen corresponding path program 1 times [2020-10-20 08:02:14,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:14,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170606231] [2020-10-20 08:02:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:14,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:14,454 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:14,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 425213967, now seen corresponding path program 1 times [2020-10-20 08:02:14,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:14,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15839144] [2020-10-20 08:02:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:02:14,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15839144] [2020-10-20 08:02:14,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:02:14,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:02:14,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477166810] [2020-10-20 08:02:14,945 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-20 08:02:15,069 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-20 08:02:15,071 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:02:15,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:02:15,071 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:02:15,071 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:02:15,072 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:02:15,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:15,072 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:02:15,072 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:02:15,072 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration25_Loop [2020-10-20 08:02:15,072 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:02:15,072 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:02:15,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,244 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-10-20 08:02:15,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:15,664 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:02:15,664 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:15,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:15,681 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:15,686 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:15,686 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret11=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:15,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:15,733 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:15,739 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:15,739 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~b0_ev~0=3} Honda state: {~b0_ev~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:15,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:15,793 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:15,797 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:15,797 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret9=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:15,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:15,849 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:15,856 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:15,856 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:15,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:15,903 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:15,907 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:15,907 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z_ev~0=3} Honda state: {~z_ev~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:15,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:15,956 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:15,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:15,961 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~tmp~3=0} Honda state: {ULTIMATE.start_start_simulation_~tmp~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:16,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:16,013 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,020 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:02:16,020 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z_req_up~0=0} Honda state: {~z_req_up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:16,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:02:16,060 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:02:16,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:02:16,093 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:02:16,126 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:02:16,126 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:02:16,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:02:16,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:02:16,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:02:16,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,127 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:02:16,127 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:02:16,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration25_Loop [2020-10-20 08:02:16,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:02:16,129 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:02:16,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:02:16,581 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:02:16,581 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:16,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:16,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:16,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:16,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:16,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:16,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:16,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:16,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:16,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,676 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:02:16,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,677 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:02:16,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:16,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:16,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,704 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:02:16,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,705 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:02:16,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:16,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:16,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:16,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:16,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:16,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:16,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:16,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:16,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:16,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:16,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:16,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:16,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:02:16,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:02:16,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:02:16,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:02:16,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:02:16,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:02:16,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:02:16,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:02:16,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:02:16,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,824 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:02:16,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:02:16,830 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:02:16,833 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:02:16,833 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:02:16,833 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:02:16,833 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b1_ev~0) = -2*~b1_ev~0 + 3 Supporting invariants [] [2020-10-20 08:02:16,854 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:02:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:02:16,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:02:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:02:16,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:02:16,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:02:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 08:02:17,005 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:02:17,005 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2295 states and 3187 transitions. cyclomatic complexity: 895 Second operand 5 states. [2020-10-20 08:02:17,124 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2295 states and 3187 transitions. cyclomatic complexity: 895. Second operand 5 states. Result 5962 states and 8267 transitions. Complement of second has 7 states. [2020-10-20 08:02:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:02:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:02:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2020-10-20 08:02:17,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 33 letters. Loop has 56 letters. [2020-10-20 08:02:17,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:02:17,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 89 letters. Loop has 56 letters. [2020-10-20 08:02:17,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:02:17,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 33 letters. Loop has 112 letters. [2020-10-20 08:02:17,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:02:17,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5962 states and 8267 transitions. [2020-10-20 08:02:17,160 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2428 [2020-10-20 08:02:17,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5962 states to 5570 states and 7767 transitions. [2020-10-20 08:02:17,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2505 [2020-10-20 08:02:17,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2520 [2020-10-20 08:02:17,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 7767 transitions. [2020-10-20 08:02:17,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:17,204 INFO L691 BuchiCegarLoop]: Abstraction has 5570 states and 7767 transitions. [2020-10-20 08:02:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 7767 transitions. [2020-10-20 08:02:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5539. [2020-10-20 08:02:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5539 states. [2020-10-20 08:02:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 7720 transitions. [2020-10-20 08:02:17,307 INFO L714 BuchiCegarLoop]: Abstraction has 5539 states and 7720 transitions. [2020-10-20 08:02:17,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:02:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:02:17,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:02:17,307 INFO L87 Difference]: Start difference. First operand 5539 states and 7720 transitions. Second operand 4 states. [2020-10-20 08:02:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:02:17,370 INFO L93 Difference]: Finished difference Result 8355 states and 11527 transitions. [2020-10-20 08:02:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:02:17,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8355 states and 11527 transitions. [2020-10-20 08:02:17,417 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4288 [2020-10-20 08:02:17,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8355 states to 8355 states and 11527 transitions. [2020-10-20 08:02:17,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4365 [2020-10-20 08:02:17,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4365 [2020-10-20 08:02:17,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8355 states and 11527 transitions. [2020-10-20 08:02:17,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:02:17,479 INFO L691 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2020-10-20 08:02:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states and 11527 transitions. [2020-10-20 08:02:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 8355. [2020-10-20 08:02:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8355 states. [2020-10-20 08:02:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 11527 transitions. [2020-10-20 08:02:18,120 INFO L714 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2020-10-20 08:02:18,120 INFO L594 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2020-10-20 08:02:18,120 INFO L427 BuchiCegarLoop]: ======== Iteration 26============ [2020-10-20 08:02:18,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8355 states and 11527 transitions. [2020-10-20 08:02:18,146 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4288 [2020-10-20 08:02:18,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:02:18,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:02:18,147 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-10-20 08:02:18,147 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:02:18,148 INFO L794 eck$LassoCheckResult]: Stem: 52421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(16);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 52241#L-1 havoc main_#res;havoc main_~__retres1~2;havoc main_~__retres1~2;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 52242#L482 havoc start_simulation_#t~ret11, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 52398#L204 assume 1 == ~b0_req_up~0; 52407#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 52448#L129-2 ~b0_req_up~0 := 0; 52405#L204-1 assume 1 == ~b1_req_up~0; 52298#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 52299#L144-2 ~b1_req_up~0 := 0; 52343#L211 assume 1 == ~d0_req_up~0; 52479#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 52447#L159-2 ~d0_req_up~0 := 0; 52352#L218 assume 1 == ~d1_req_up~0; 52353#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 52382#L174-2 ~d1_req_up~0 := 0; 52383#L225 assume !(1 == ~z_req_up~0); 52309#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 52310#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 52464#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 52465#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 52492#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 52384#L328-1 assume !(0 == ~z_ev~0); 52385#L333-1 havoc activate_threads_#t~ret9, activate_threads_~tmp~1;havoc activate_threads_~tmp~1;havoc is_method1_triggered_#res;havoc is_method1_triggered_~__retres1~0;havoc is_method1_triggered_~__retres1~0; 53451#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 53450#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 53449#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 53448#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 53447#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 52461#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 52247#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 52248#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 52300#L361-1 assume !(1 == ~z_ev~0); 52381#L424-1 assume !false; 53963#L425 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 54439#L287 [2020-10-20 08:02:18,148 INFO L796 eck$LassoCheckResult]: Loop: 54439#L287 assume !false; 59753#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 59752#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 56802#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 59748#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 59745#L282 assume 0 != eval_~tmp___0~0; 57185#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 57182#L291 assume !(0 != eval_~tmp~0); 54439#L287 [2020-10-20 08:02:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1082183973, now seen corresponding path program 1 times [2020-10-20 08:02:18,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:18,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681909124] [2020-10-20 08:02:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:18,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:18,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:18,174 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1768213899, now seen corresponding path program 1 times [2020-10-20 08:02:18,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:18,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651238098] [2020-10-20 08:02:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:18,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:18,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:18,181 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:02:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash -937655707, now seen corresponding path program 1 times [2020-10-20 08:02:18,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:02:18,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715762192] [2020-10-20 08:02:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:02:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:18,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:02:18,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:02:18,207 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:02:19,440 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 213 DAG size of output: 189 [2020-10-20 08:02:19,647 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-20 08:02:19,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:02:19 BoogieIcfgContainer [2020-10-20 08:02:19,688 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:02:19,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:02:19,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:02:19,689 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:02:19,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:02:08" (3/4) ... [2020-10-20 08:02:19,693 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:02:19,751 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:02:19,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:02:19,753 INFO L168 Benchmark]: Toolchain (without parser) took 12783.13 ms. Allocated memory was 34.6 MB in the beginning and 186.6 MB in the end (delta: 152.0 MB). Free memory was 11.1 MB in the beginning and 101.5 MB in the end (delta: -90.4 MB). Peak memory consumption was 61.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,753 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 33.0 MB. Free memory was 17.7 MB in the beginning and 17.7 MB in the end (delta: 40.2 kB). Peak memory consumption was 40.2 kB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.36 ms. Allocated memory was 34.6 MB in the beginning and 43.5 MB in the end (delta: 8.9 MB). Free memory was 10.2 MB in the beginning and 18.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.20 ms. Allocated memory is still 43.5 MB. Free memory was 18.4 MB in the beginning and 15.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,755 INFO L168 Benchmark]: Boogie Preprocessor took 46.19 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 15.8 MB in the beginning and 25.5 MB in the end (delta: -9.8 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,755 INFO L168 Benchmark]: RCFGBuilder took 663.32 ms. Allocated memory was 45.1 MB in the beginning and 47.2 MB in the end (delta: 2.1 MB). Free memory was 25.3 MB in the beginning and 20.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,756 INFO L168 Benchmark]: BuchiAutomizer took 11509.47 ms. Allocated memory was 47.2 MB in the beginning and 186.6 MB in the end (delta: 139.5 MB). Free memory was 20.8 MB in the beginning and 107.2 MB in the end (delta: -86.4 MB). Peak memory consumption was 138.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,756 INFO L168 Benchmark]: Witness Printer took 63.20 ms. Allocated memory is still 186.6 MB. Free memory was 107.2 MB in the beginning and 101.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:02:19,759 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 33.0 MB. Free memory was 17.7 MB in the beginning and 17.7 MB in the end (delta: 40.2 kB). Peak memory consumption was 40.2 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 436.36 ms. Allocated memory was 34.6 MB in the beginning and 43.5 MB in the end (delta: 8.9 MB). Free memory was 10.2 MB in the beginning and 18.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 54.20 ms. Allocated memory is still 43.5 MB. Free memory was 18.4 MB in the beginning and 15.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 46.19 ms. Allocated memory was 43.5 MB in the beginning and 45.1 MB in the end (delta: 1.6 MB). Free memory was 15.8 MB in the beginning and 25.5 MB in the end (delta: -9.8 MB). Peak memory consumption was 3.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 663.32 ms. Allocated memory was 45.1 MB in the beginning and 47.2 MB in the end (delta: 2.1 MB). Free memory was 25.3 MB in the beginning and 20.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 11509.47 ms. Allocated memory was 47.2 MB in the beginning and 186.6 MB in the end (delta: 139.5 MB). Free memory was 20.8 MB in the beginning and 107.2 MB in the end (delta: -86.4 MB). Peak memory consumption was 138.9 MB. Max. memory is 14.3 GB. * Witness Printer took 63.20 ms. Allocated memory is still 186.6 MB. Free memory was 107.2 MB in the beginning and 101.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 27 terminating modules (25 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * b0_ev + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * b1_ev + 3 and consists of 4 locations. 25 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 8355 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 26 iterations. TraceHistogramMax:2. Analysis of lassos took 7.8s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 19. Minimization of nondet autom 8. Automata minimization 1.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 4574 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 8355 states and ocurred in iteration 25. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/6 HoareTripleCheckerStatistics: 4476 SDtfs, 1821 SDslu, 5083 SDs, 0 SdLazy, 378 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT2 SILN0 SILU0 SILI19 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital105 mio100 ax100 hnf100 lsp10 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf155 smp76 tf109 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 277]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cf51d3b=0, b1_val_t=1, NULL=4, NULL=0, \result=0, d0_val=1, NULL=1, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67ecc874=0, z_val=0, tmp=0, b0_val_t=1, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d215b03=0, d1_ev=2, comp_m1_i=0, b1_val=1, d1_req_up=0, tmp___0=1, NULL=2, z_val_t=0, b1_req_up=0, __retres1=1, d0_ev=2, NULL=0, NULL=0, NULL=0, z_ev=2, tmp=0, b1_ev=2, NULL=3, comp_m1_st=0, b0_req_up=0, z_req_up=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48f20234=0, d1_val=1, b0_ev=2, NULL=0, tmp=1, d0_val_t=1, d1_val_t=1, b0_val=1, __retres1=0, d0_req_up=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 277]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int b0_val ; [L17] int b0_val_t ; [L18] int b0_ev ; [L19] int b0_req_up ; [L20] int b1_val ; [L21] int b1_val_t ; [L22] int b1_ev ; [L23] int b1_req_up ; [L24] int d0_val ; [L25] int d0_val_t ; [L26] int d0_ev ; [L27] int d0_req_up ; [L28] int d1_val ; [L29] int d1_val_t ; [L30] int d1_ev ; [L31] int d1_req_up ; [L32] int z_val ; [L33] int z_val_t ; [L34] int z_ev ; [L35] int z_req_up ; [L36] int comp_m1_st ; [L37] int comp_m1_i ; [L486] int __retres1 ; [L457] b0_val = 0 [L458] b0_ev = 2 [L459] b0_req_up = 0 [L460] b1_val = 0 [L461] b1_ev = 2 [L462] b1_req_up = 0 [L463] d0_val = 0 [L464] d0_ev = 2 [L465] d0_req_up = 0 [L466] d1_val = 0 [L467] d1_ev = 2 [L468] d1_req_up = 0 [L469] z_val = 0 [L470] z_ev = 2 [L471] z_req_up = 0 [L472] b0_val_t = 1 [L473] b0_req_up = 1 [L474] b1_val_t = 1 [L475] b1_req_up = 1 [L476] d0_val_t = 1 [L477] d0_req_up = 1 [L478] d1_val_t = 1 [L479] d1_req_up = 1 [L480] comp_m1_i = 0 [L411] int kernel_st ; [L412] int tmp ; [L416] kernel_st = 0 [L204] COND TRUE (int )b0_req_up == 1 [L129] COND TRUE (int )b0_val != (int )b0_val_t [L130] b0_val = b0_val_t [L131] b0_ev = 0 [L135] b0_req_up = 0 [L211] COND TRUE (int )b1_req_up == 1 [L144] COND TRUE (int )b1_val != (int )b1_val_t [L145] b1_val = b1_val_t [L146] b1_ev = 0 [L150] b1_req_up = 0 [L218] COND TRUE (int )d0_req_up == 1 [L159] COND TRUE (int )d0_val != (int )d0_val_t [L160] d0_val = d0_val_t [L161] d0_ev = 0 [L165] d0_req_up = 0 [L225] COND TRUE (int )d1_req_up == 1 [L174] COND TRUE (int )d1_val != (int )d1_val_t [L175] d1_val = d1_val_t [L176] d1_ev = 0 [L180] d1_req_up = 0 [L232] COND FALSE !((int )z_req_up == 1) [L247] COND FALSE !((int )comp_m1_i == 1) [L250] comp_m1_st = 2 [L313] COND TRUE (int )b0_ev == 0 [L314] b0_ev = 1 [L318] COND TRUE (int )b1_ev == 0 [L319] b1_ev = 1 [L323] COND TRUE (int )d0_ev == 0 [L324] d0_ev = 1 [L328] COND TRUE (int )d1_ev == 0 [L329] d1_ev = 1 [L333] COND FALSE !((int )z_ev == 0) [L376] int tmp ; [L96] int __retres1 ; [L99] COND TRUE (int )b0_ev == 1 [L100] __retres1 = 1 [L122] return (__retres1); [L380] tmp = is_method1_triggered() [L382] COND TRUE \read(tmp) [L383] comp_m1_st = 0 [L346] COND TRUE (int )b0_ev == 1 [L347] b0_ev = 2 [L351] COND TRUE (int )b1_ev == 1 [L352] b1_ev = 2 [L356] COND TRUE (int )d0_ev == 1 [L357] d0_ev = 2 [L361] COND TRUE (int )d1_ev == 1 [L362] d1_ev = 2 [L366] COND FALSE !((int )z_ev == 1) [L424] COND TRUE 1 [L427] kernel_st = 1 [L272] int tmp ; [L273] int tmp___0 ; Loop: [L277] COND TRUE 1 [L257] int __retres1 ; [L260] COND TRUE (int )comp_m1_st == 0 [L261] __retres1 = 1 [L268] return (__retres1); [L280] tmp___0 = exists_runnable_thread() [L282] COND TRUE \read(tmp___0) [L287] COND TRUE (int )comp_m1_st == 0 [L289] tmp = __VERIFIER_nondet_int() [L291] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...