./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 20ed64ec 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.5.800.v20200727-1323.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.2.1-dev-20ed64e [2021-08-27 16:30:00,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:30:00,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:30:01,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:30:01,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:30:01,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:30:01,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:30:01,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:30:01,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:30:01,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:30:01,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:30:01,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:30:01,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:30:01,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:30:01,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:30:01,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:30:01,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:30:01,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:30:01,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:30:01,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:30:01,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:30:01,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:30:01,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:30:01,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:30:01,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:30:01,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:30:01,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:30:01,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:30:01,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:30:01,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:30:01,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:30:01,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:30:01,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:30:01,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:30:01,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:30:01,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:30:01,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:30:01,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:30:01,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:30:01,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:30:01,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:30:01,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:30:01,077 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:30:01,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:30:01,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:30:01,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:30:01,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:30:01,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:30:01,079 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:30:01,079 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:30:01,079 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:30:01,079 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:30:01,079 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:30:01,079 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:30:01,079 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:30:01,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:30:01,080 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:30:01,080 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:30:01,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:30:01,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:30:01,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:30:01,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:30:01,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:30:01,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:30:01,081 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:30:01,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:30:01,081 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:30:01,081 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:30:01,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:30:01,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:30:01,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:30:01,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:30:01,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:30:01,082 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:30:01,083 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:30:01,083 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2021-08-27 16:30:01,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:30:01,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:30:01,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:30:01,376 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:30:01,376 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:30:01,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-08-27 16:30:01,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9c62eb0/d2b0b39926c845d6836499947f195a49/FLAG22ff379da [2021-08-27 16:30:01,826 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:30:01,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-08-27 16:30:01,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9c62eb0/d2b0b39926c845d6836499947f195a49/FLAG22ff379da [2021-08-27 16:30:02,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9c62eb0/d2b0b39926c845d6836499947f195a49 [2021-08-27 16:30:02,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:30:02,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:30:02,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:30:02,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:30:02,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:30:02,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7691106f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02, skipping insertion in model container [2021-08-27 16:30:02,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:30:02,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:30:02,393 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-08-27 16:30:02,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:30:02,427 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:30:02,439 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-08-27 16:30:02,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:30:02,486 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:30:02,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02 WrapperNode [2021-08-27 16:30:02,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:30:02,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:30:02,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:30:02,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:30:02,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:30:02,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:30:02,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:30:02,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:30:02,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:30:02,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:30:02,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:30:02,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:30:02,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,583 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:02,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:02,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:02,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 16:30:02,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:30:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:30:02,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:30:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:30:03,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:30:03,056 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2021-08-27 16:30:03,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:03 BoogieIcfgContainer [2021-08-27 16:30:03,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:30:03,059 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:30:03,059 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:30:03,061 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:30:03,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:03,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:30:02" (1/3) ... [2021-08-27 16:30:03,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55004d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:30:03, skipping insertion in model container [2021-08-27 16:30:03,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:03,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (2/3) ... [2021-08-27 16:30:03,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55004d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:30:03, skipping insertion in model container [2021-08-27 16:30:03,064 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:03,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:03" (3/3) ... [2021-08-27 16:30:03,065 INFO L389 chiAutomizerObserver]: Analyzing ICFG bist_cell.cil.c [2021-08-27 16:30:03,092 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:30:03,092 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:30:03,092 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:30:03,092 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:30:03,092 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:30:03,092 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:30:03,093 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:30:03,093 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:30:03,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 106 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,125 INFO L842 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] [2021-08-27 16:30:03,125 INFO L843 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] [2021-08-27 16:30:03,126 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:30:03,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 107 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 106 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,132 INFO L842 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] [2021-08-27 16:30:03,132 INFO L843 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] [2021-08-27 16:30:03,137 INFO L791 eck$LassoCheckResult]: Stem: 96#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; 32#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; 46#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; 83#L204true assume !(1 == ~b0_req_up~0); 45#L204-1true assume !(1 == ~b1_req_up~0); 77#L211true assume !(1 == ~d0_req_up~0); 33#L218true assume !(1 == ~d1_req_up~0); 28#L225true assume !(1 == ~z_req_up~0); 107#L232true assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 92#L247-1true assume !(0 == ~b0_ev~0); 97#L313-1true assume !(0 == ~b1_ev~0); 48#L318-1true assume !(0 == ~d0_ev~0); 73#L323-1true assume !(0 == ~d1_ev~0); 63#L328-1true assume !(0 == ~z_ev~0); 86#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; 84#L99true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 20#L121true is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 41#L122true activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 94#L382true assume !(0 != activate_threads_~tmp~1); 11#L382-2true assume !(1 == ~b0_ev~0); 17#L346-1true assume !(1 == ~b1_ev~0); 21#L351-1true assume !(1 == ~d0_ev~0); 22#L356-1true assume !(1 == ~d1_ev~0); 12#L361-1true assume !(1 == ~z_ev~0); 100#L424-1true [2021-08-27 16:30:03,137 INFO L793 eck$LassoCheckResult]: Loop: 100#L424-1true assume !false; 82#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; 47#L287true assume false; 99#L303true start_simulation_~kernel_st~0 := 2; 75#L204-2true assume !(1 == ~b0_req_up~0); 43#L204-3true assume !(1 == ~b1_req_up~0); 85#L211-1true assume !(1 == ~d0_req_up~0); 34#L218-1true assume !(1 == ~d1_req_up~0); 74#L225-1true assume !(1 == ~z_req_up~0); 79#L232-1true start_simulation_~kernel_st~0 := 3; 76#L313-2true assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 64#L313-4true assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 72#L318-3true assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 105#L323-3true assume !(0 == ~d1_ev~0); 101#L328-3true assume 0 == ~z_ev~0;~z_ev~0 := 1; 56#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; 38#L99-1true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 80#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; 24#L382-3true assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 67#L382-5true assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 44#L346-3true assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 65#L351-3true assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 69#L356-3true assume !(1 == ~d1_ev~0); 5#L361-3true assume 1 == ~z_ev~0;~z_ev~0 := 2; 59#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; 68#L260-1true assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 27#L267-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 54#L268-1true stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 53#L399true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 31#L406true stop_simulation_#res := stop_simulation_~__retres2~0; 9#L407true start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 15#L441true assume !(0 != start_simulation_~tmp~3); 100#L424-1true [2021-08-27 16:30:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash 201072121, now seen corresponding path program 1 times [2021-08-27 16:30:03,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153534807] [2021-08-27 16:30:03,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153534807] [2021-08-27 16:30:03,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153534807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:03,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131004688] [2021-08-27 16:30:03,269 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash -503786151, now seen corresponding path program 1 times [2021-08-27 16:30:03,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066887656] [2021-08-27 16:30:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066887656] [2021-08-27 16:30:03,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066887656] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:30:03,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203984548] [2021-08-27 16:30:03,287 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:03,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:03,298 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 106 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:03,328 INFO L93 Difference]: Finished difference Result 107 states and 173 transitions. [2021-08-27 16:30:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:03,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 173 transitions. [2021-08-27 16:30:03,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 167 transitions. [2021-08-27 16:30:03,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:03,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:03,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 167 transitions. [2021-08-27 16:30:03,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:03,338 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2021-08-27 16:30:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 167 transitions. [2021-08-27 16:30:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2021-08-27 16:30:03,359 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2021-08-27 16:30:03,359 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 167 transitions. [2021-08-27 16:30:03,359 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:30:03,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 167 transitions. [2021-08-27 16:30:03,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,362 INFO L842 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] [2021-08-27 16:30:03,362 INFO L843 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] [2021-08-27 16:30:03,362 INFO L791 eck$LassoCheckResult]: Stem: 322#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; 268#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; 269#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; 286#L204 assume 1 == ~b0_req_up~0; 312#L129 assume !(~b0_val~0 != ~b0_val_t~0); 232#L129-2 ~b0_req_up~0 := 0; 233#L204-1 assume !(1 == ~b1_req_up~0); 285#L211 assume !(1 == ~d0_req_up~0); 270#L218 assume !(1 == ~d1_req_up~0); 260#L225 assume !(1 == ~z_req_up~0); 261#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 318#L247-1 assume !(0 == ~b0_ev~0); 319#L313-1 assume !(0 == ~b1_ev~0); 289#L318-1 assume !(0 == ~d0_ev~0); 290#L323-1 assume !(0 == ~d1_ev~0); 299#L328-1 assume !(0 == ~z_ev~0); 300#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; 313#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 241#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 248#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 280#L382 assume !(0 != activate_threads_~tmp~1); 236#L382-2 assume !(1 == ~b0_ev~0); 237#L346-1 assume !(1 == ~b1_ev~0); 244#L351-1 assume !(1 == ~d0_ev~0); 249#L356-1 assume !(1 == ~d1_ev~0); 238#L361-1 assume !(1 == ~z_ev~0); 239#L424-1 [2021-08-27 16:30:03,363 INFO L793 eck$LassoCheckResult]: Loop: 239#L424-1 assume !false; 311#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; 287#L287 assume !false; 288#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 291#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 247#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 242#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 223#L282 assume !(0 != eval_~tmp___0~0); 225#L303 start_simulation_~kernel_st~0 := 2; 307#L204-2 assume !(1 == ~b0_req_up~0); 281#L204-3 assume !(1 == ~b1_req_up~0); 276#L211-1 assume !(1 == ~d0_req_up~0); 264#L218-1 assume !(1 == ~d1_req_up~0); 243#L225-1 assume !(1 == ~z_req_up~0); 305#L232-1 start_simulation_~kernel_st~0 := 3; 309#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 301#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 302#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 304#L323-3 assume !(0 == ~d1_ev~0); 323#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 295#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; 278#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 273#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 277#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 250#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 251#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 283#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 284#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 303#L356-3 assume !(1 == ~d1_ev~0); 226#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 227#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; 296#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 258#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 259#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 293#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 267#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 234#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 235#L441 assume !(0 != start_simulation_~tmp~3); 239#L424-1 [2021-08-27 16:30:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 987671025, now seen corresponding path program 1 times [2021-08-27 16:30:03,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535189292] [2021-08-27 16:30:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535189292] [2021-08-27 16:30:03,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535189292] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:03,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244468118] [2021-08-27 16:30:03,423 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 1 times [2021-08-27 16:30:03,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590635315] [2021-08-27 16:30:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590635315] [2021-08-27 16:30:03,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590635315] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:03,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803812739] [2021-08-27 16:30:03,474 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:03,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:03,475 INFO L87 Difference]: Start difference. First operand 101 states and 167 transitions. cyclomatic complexity: 67 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:03,504 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2021-08-27 16:30:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:03,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 166 transitions. [2021-08-27 16:30:03,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 166 transitions. [2021-08-27 16:30:03,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:03,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:03,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 166 transitions. [2021-08-27 16:30:03,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:03,508 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2021-08-27 16:30:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 166 transitions. [2021-08-27 16:30:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 166 transitions. [2021-08-27 16:30:03,513 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2021-08-27 16:30:03,513 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 166 transitions. [2021-08-27 16:30:03,513 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:30:03,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 166 transitions. [2021-08-27 16:30:03,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,515 INFO L842 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] [2021-08-27 16:30:03,515 INFO L843 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] [2021-08-27 16:30:03,515 INFO L791 eck$LassoCheckResult]: Stem: 533#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; 479#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; 480#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; 497#L204 assume 1 == ~b0_req_up~0; 523#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 443#L129-2 ~b0_req_up~0 := 0; 444#L204-1 assume !(1 == ~b1_req_up~0); 496#L211 assume !(1 == ~d0_req_up~0); 481#L218 assume !(1 == ~d1_req_up~0); 471#L225 assume !(1 == ~z_req_up~0); 472#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 529#L247-1 assume !(0 == ~b0_ev~0); 530#L313-1 assume !(0 == ~b1_ev~0); 500#L318-1 assume !(0 == ~d0_ev~0); 501#L323-1 assume !(0 == ~d1_ev~0); 510#L328-1 assume !(0 == ~z_ev~0); 511#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; 524#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 452#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 459#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 491#L382 assume !(0 != activate_threads_~tmp~1); 447#L382-2 assume !(1 == ~b0_ev~0); 448#L346-1 assume !(1 == ~b1_ev~0); 455#L351-1 assume !(1 == ~d0_ev~0); 460#L356-1 assume !(1 == ~d1_ev~0); 449#L361-1 assume !(1 == ~z_ev~0); 450#L424-1 [2021-08-27 16:30:03,515 INFO L793 eck$LassoCheckResult]: Loop: 450#L424-1 assume !false; 522#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; 498#L287 assume !false; 499#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 502#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 458#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 453#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 434#L282 assume !(0 != eval_~tmp___0~0); 436#L303 start_simulation_~kernel_st~0 := 2; 518#L204-2 assume !(1 == ~b0_req_up~0); 492#L204-3 assume !(1 == ~b1_req_up~0); 487#L211-1 assume !(1 == ~d0_req_up~0); 475#L218-1 assume !(1 == ~d1_req_up~0); 454#L225-1 assume !(1 == ~z_req_up~0); 516#L232-1 start_simulation_~kernel_st~0 := 3; 520#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 512#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 513#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 515#L323-3 assume !(0 == ~d1_ev~0); 534#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 506#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; 489#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 484#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 488#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 461#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 462#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 494#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 495#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 514#L356-3 assume !(1 == ~d1_ev~0); 437#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 438#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; 507#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 469#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 470#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 504#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 478#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 445#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 446#L441 assume !(0 != start_simulation_~tmp~3); 450#L424-1 [2021-08-27 16:30:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash 768816307, now seen corresponding path program 1 times [2021-08-27 16:30:03,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942443578] [2021-08-27 16:30:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942443578] [2021-08-27 16:30:03,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942443578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:03,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235375389] [2021-08-27 16:30:03,550 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 2 times [2021-08-27 16:30:03,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410291991] [2021-08-27 16:30:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410291991] [2021-08-27 16:30:03,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410291991] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:03,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365954476] [2021-08-27 16:30:03,580 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:03,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:03,581 INFO L87 Difference]: Start difference. First operand 101 states and 166 transitions. cyclomatic complexity: 66 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:03,592 INFO L93 Difference]: Finished difference Result 101 states and 165 transitions. [2021-08-27 16:30:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:03,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 165 transitions. [2021-08-27 16:30:03,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 165 transitions. [2021-08-27 16:30:03,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:03,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:03,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 165 transitions. [2021-08-27 16:30:03,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:03,596 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2021-08-27 16:30:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 165 transitions. [2021-08-27 16:30:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 100 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 165 transitions. [2021-08-27 16:30:03,600 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2021-08-27 16:30:03,600 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 165 transitions. [2021-08-27 16:30:03,600 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:30:03,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 165 transitions. [2021-08-27 16:30:03,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,601 INFO L842 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] [2021-08-27 16:30:03,601 INFO L843 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] [2021-08-27 16:30:03,602 INFO L791 eck$LassoCheckResult]: Stem: 744#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; 690#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; 691#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; 707#L204 assume 1 == ~b0_req_up~0; 734#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 654#L129-2 ~b0_req_up~0 := 0; 655#L204-1 assume 1 == ~b1_req_up~0; 652#L144 assume !(~b1_val~0 != ~b1_val_t~0); 653#L144-2 ~b1_req_up~0 := 0; 717#L211 assume !(1 == ~d0_req_up~0); 692#L218 assume !(1 == ~d1_req_up~0); 682#L225 assume !(1 == ~z_req_up~0); 683#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 740#L247-1 assume !(0 == ~b0_ev~0); 741#L313-1 assume !(0 == ~b1_ev~0); 710#L318-1 assume !(0 == ~d0_ev~0); 711#L323-1 assume !(0 == ~d1_ev~0); 721#L328-1 assume !(0 == ~z_ev~0); 722#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; 735#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 663#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 670#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 702#L382 assume !(0 != activate_threads_~tmp~1); 658#L382-2 assume !(1 == ~b0_ev~0); 659#L346-1 assume !(1 == ~b1_ev~0); 666#L351-1 assume !(1 == ~d0_ev~0); 671#L356-1 assume !(1 == ~d1_ev~0); 660#L361-1 assume !(1 == ~z_ev~0); 661#L424-1 [2021-08-27 16:30:03,602 INFO L793 eck$LassoCheckResult]: Loop: 661#L424-1 assume !false; 733#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; 708#L287 assume !false; 709#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 712#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 669#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 664#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 645#L282 assume !(0 != eval_~tmp___0~0); 647#L303 start_simulation_~kernel_st~0 := 2; 729#L204-2 assume !(1 == ~b0_req_up~0); 703#L204-3 assume !(1 == ~b1_req_up~0); 698#L211-1 assume !(1 == ~d0_req_up~0); 686#L218-1 assume !(1 == ~d1_req_up~0); 665#L225-1 assume !(1 == ~z_req_up~0); 727#L232-1 start_simulation_~kernel_st~0 := 3; 731#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 723#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 724#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 726#L323-3 assume !(0 == ~d1_ev~0); 745#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 716#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; 700#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 695#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 699#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 672#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 673#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 705#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 706#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 725#L356-3 assume !(1 == ~d1_ev~0); 648#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 649#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; 718#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 680#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 681#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 714#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 689#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 656#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 657#L441 assume !(0 != start_simulation_~tmp~3); 661#L424-1 [2021-08-27 16:30:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1003190981, now seen corresponding path program 1 times [2021-08-27 16:30:03,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440373003] [2021-08-27 16:30:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440373003] [2021-08-27 16:30:03,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440373003] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:30:03,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257766688] [2021-08-27 16:30:03,643 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 3 times [2021-08-27 16:30:03,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365027183] [2021-08-27 16:30:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365027183] [2021-08-27 16:30:03,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365027183] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:03,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81354509] [2021-08-27 16:30:03,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:30:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:30:03,698 INFO L87 Difference]: Start difference. First operand 101 states and 165 transitions. cyclomatic complexity: 65 Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:03,761 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2021-08-27 16:30:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:30:03,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 164 transitions. [2021-08-27 16:30:03,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 164 transitions. [2021-08-27 16:30:03,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:03,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:03,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 164 transitions. [2021-08-27 16:30:03,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:03,767 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2021-08-27 16:30:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 164 transitions. [2021-08-27 16:30:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6237623762376239) internal successors, (164), 100 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 164 transitions. [2021-08-27 16:30:03,771 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2021-08-27 16:30:03,771 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 164 transitions. [2021-08-27 16:30:03,771 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:30:03,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 164 transitions. [2021-08-27 16:30:03,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,780 INFO L842 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] [2021-08-27 16:30:03,780 INFO L843 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] [2021-08-27 16:30:03,781 INFO L791 eck$LassoCheckResult]: Stem: 958#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; 904#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; 905#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; 921#L204 assume 1 == ~b0_req_up~0; 951#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 868#L129-2 ~b0_req_up~0 := 0; 869#L204-1 assume 1 == ~b1_req_up~0; 866#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 867#L144-2 ~b1_req_up~0 := 0; 931#L211 assume !(1 == ~d0_req_up~0); 906#L218 assume !(1 == ~d1_req_up~0); 896#L225 assume !(1 == ~z_req_up~0); 897#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 954#L247-1 assume !(0 == ~b0_ev~0); 955#L313-1 assume !(0 == ~b1_ev~0); 924#L318-1 assume !(0 == ~d0_ev~0); 925#L323-1 assume !(0 == ~d1_ev~0); 935#L328-1 assume !(0 == ~z_ev~0); 936#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; 948#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 877#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 884#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 916#L382 assume !(0 != activate_threads_~tmp~1); 872#L382-2 assume !(1 == ~b0_ev~0); 873#L346-1 assume !(1 == ~b1_ev~0); 880#L351-1 assume !(1 == ~d0_ev~0); 885#L356-1 assume !(1 == ~d1_ev~0); 874#L361-1 assume !(1 == ~z_ev~0); 875#L424-1 [2021-08-27 16:30:03,781 INFO L793 eck$LassoCheckResult]: Loop: 875#L424-1 assume !false; 947#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; 922#L287 assume !false; 923#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 926#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 883#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 878#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 859#L282 assume !(0 != eval_~tmp___0~0); 861#L303 start_simulation_~kernel_st~0 := 2; 943#L204-2 assume !(1 == ~b0_req_up~0); 917#L204-3 assume !(1 == ~b1_req_up~0); 912#L211-1 assume !(1 == ~d0_req_up~0); 900#L218-1 assume !(1 == ~d1_req_up~0); 879#L225-1 assume !(1 == ~z_req_up~0); 941#L232-1 start_simulation_~kernel_st~0 := 3; 945#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 937#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 938#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 940#L323-3 assume !(0 == ~d1_ev~0); 959#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 930#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; 914#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 909#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 913#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 886#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 887#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 919#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 920#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 939#L356-3 assume !(1 == ~d1_ev~0); 862#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 863#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; 932#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 894#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 895#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 928#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 903#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 870#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 871#L441 assume !(0 != start_simulation_~tmp~3); 875#L424-1 [2021-08-27 16:30:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1425892807, now seen corresponding path program 1 times [2021-08-27 16:30:03,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771541783] [2021-08-27 16:30:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771541783] [2021-08-27 16:30:03,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771541783] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:03,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451708249] [2021-08-27 16:30:03,817 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 4 times [2021-08-27 16:30:03,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527890740] [2021-08-27 16:30:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527890740] [2021-08-27 16:30:03,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527890740] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:03,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840167810] [2021-08-27 16:30:03,855 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:03,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:03,858 INFO L87 Difference]: Start difference. First operand 101 states and 164 transitions. cyclomatic complexity: 64 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:03,869 INFO L93 Difference]: Finished difference Result 101 states and 163 transitions. [2021-08-27 16:30:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:03,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 163 transitions. [2021-08-27 16:30:03,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 163 transitions. [2021-08-27 16:30:03,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:03,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:03,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 163 transitions. [2021-08-27 16:30:03,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:03,875 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2021-08-27 16:30:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 163 transitions. [2021-08-27 16:30:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.613861386138614) internal successors, (163), 100 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2021-08-27 16:30:03,884 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2021-08-27 16:30:03,884 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 163 transitions. [2021-08-27 16:30:03,884 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 16:30:03,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 163 transitions. [2021-08-27 16:30:03,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:03,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,885 INFO L842 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] [2021-08-27 16:30:03,885 INFO L843 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] [2021-08-27 16:30:03,885 INFO L791 eck$LassoCheckResult]: Stem: 1169#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; 1115#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; 1116#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; 1132#L204 assume 1 == ~b0_req_up~0; 1160#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1079#L129-2 ~b0_req_up~0 := 0; 1080#L204-1 assume 1 == ~b1_req_up~0; 1077#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1078#L144-2 ~b1_req_up~0 := 0; 1142#L211 assume 1 == ~d0_req_up~0; 1144#L159 assume !(~d0_val~0 != ~d0_val_t~0); 1145#L159-2 ~d0_req_up~0 := 0; 1117#L218 assume !(1 == ~d1_req_up~0); 1109#L225 assume !(1 == ~z_req_up~0); 1110#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1165#L247-1 assume !(0 == ~b0_ev~0); 1166#L313-1 assume !(0 == ~b1_ev~0); 1135#L318-1 assume !(0 == ~d0_ev~0); 1136#L323-1 assume !(0 == ~d1_ev~0); 1146#L328-1 assume !(0 == ~z_ev~0); 1147#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; 1161#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1088#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1095#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1127#L382 assume !(0 != activate_threads_~tmp~1); 1083#L382-2 assume !(1 == ~b0_ev~0); 1084#L346-1 assume !(1 == ~b1_ev~0); 1091#L351-1 assume !(1 == ~d0_ev~0); 1096#L356-1 assume !(1 == ~d1_ev~0); 1085#L361-1 assume !(1 == ~z_ev~0); 1086#L424-1 [2021-08-27 16:30:03,885 INFO L793 eck$LassoCheckResult]: Loop: 1086#L424-1 assume !false; 1158#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; 1133#L287 assume !false; 1134#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1137#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1094#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1089#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1070#L282 assume !(0 != eval_~tmp___0~0); 1072#L303 start_simulation_~kernel_st~0 := 2; 1154#L204-2 assume !(1 == ~b0_req_up~0); 1128#L204-3 assume !(1 == ~b1_req_up~0); 1123#L211-1 assume !(1 == ~d0_req_up~0); 1108#L218-1 assume !(1 == ~d1_req_up~0); 1090#L225-1 assume !(1 == ~z_req_up~0); 1152#L232-1 start_simulation_~kernel_st~0 := 3; 1156#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1148#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1149#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1151#L323-3 assume !(0 == ~d1_ev~0); 1170#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1141#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; 1125#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1120#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1124#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1097#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1098#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1130#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1131#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1150#L356-3 assume !(1 == ~d1_ev~0); 1073#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1074#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; 1143#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1105#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1106#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1138#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1114#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1081#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1082#L441 assume !(0 != start_simulation_~tmp~3); 1086#L424-1 [2021-08-27 16:30:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash -665750479, now seen corresponding path program 1 times [2021-08-27 16:30:03,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677234917] [2021-08-27 16:30:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677234917] [2021-08-27 16:30:03,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677234917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:30:03,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553730241] [2021-08-27 16:30:03,950 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 5 times [2021-08-27 16:30:03,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219022711] [2021-08-27 16:30:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219022711] [2021-08-27 16:30:03,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219022711] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:03,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849154814] [2021-08-27 16:30:03,995 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:30:03,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:30:03,997 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. cyclomatic complexity: 63 Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,029 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2021-08-27 16:30:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:30:04,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 162 transitions. [2021-08-27 16:30:04,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 162 transitions. [2021-08-27 16:30:04,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:04,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:04,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 162 transitions. [2021-08-27 16:30:04,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,041 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2021-08-27 16:30:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 162 transitions. [2021-08-27 16:30:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.603960396039604) internal successors, (162), 100 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2021-08-27 16:30:04,043 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2021-08-27 16:30:04,044 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 162 transitions. [2021-08-27 16:30:04,044 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 16:30:04,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 162 transitions. [2021-08-27 16:30:04,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,045 INFO L842 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] [2021-08-27 16:30:04,045 INFO L843 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] [2021-08-27 16:30:04,045 INFO L791 eck$LassoCheckResult]: Stem: 1383#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; 1329#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; 1330#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; 1346#L204 assume 1 == ~b0_req_up~0; 1373#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1293#L129-2 ~b0_req_up~0 := 0; 1294#L204-1 assume 1 == ~b1_req_up~0; 1291#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1292#L144-2 ~b1_req_up~0 := 0; 1356#L211 assume 1 == ~d0_req_up~0; 1358#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1359#L159-2 ~d0_req_up~0 := 0; 1331#L218 assume !(1 == ~d1_req_up~0); 1321#L225 assume !(1 == ~z_req_up~0); 1322#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1379#L247-1 assume !(0 == ~b0_ev~0); 1380#L313-1 assume !(0 == ~b1_ev~0); 1349#L318-1 assume !(0 == ~d0_ev~0); 1350#L323-1 assume !(0 == ~d1_ev~0); 1360#L328-1 assume !(0 == ~z_ev~0); 1361#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; 1374#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1302#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1309#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1341#L382 assume !(0 != activate_threads_~tmp~1); 1297#L382-2 assume !(1 == ~b0_ev~0); 1298#L346-1 assume !(1 == ~b1_ev~0); 1305#L351-1 assume !(1 == ~d0_ev~0); 1310#L356-1 assume !(1 == ~d1_ev~0); 1299#L361-1 assume !(1 == ~z_ev~0); 1300#L424-1 [2021-08-27 16:30:04,045 INFO L793 eck$LassoCheckResult]: Loop: 1300#L424-1 assume !false; 1372#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; 1347#L287 assume !false; 1348#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1351#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1308#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1303#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1284#L282 assume !(0 != eval_~tmp___0~0); 1286#L303 start_simulation_~kernel_st~0 := 2; 1368#L204-2 assume !(1 == ~b0_req_up~0); 1342#L204-3 assume !(1 == ~b1_req_up~0); 1337#L211-1 assume !(1 == ~d0_req_up~0); 1325#L218-1 assume !(1 == ~d1_req_up~0); 1304#L225-1 assume !(1 == ~z_req_up~0); 1366#L232-1 start_simulation_~kernel_st~0 := 3; 1370#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1362#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1363#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1365#L323-3 assume !(0 == ~d1_ev~0); 1384#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1355#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; 1339#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1334#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1338#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1311#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1312#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1344#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1345#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1364#L356-3 assume !(1 == ~d1_ev~0); 1287#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1288#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; 1357#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1319#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1320#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1352#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1328#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1295#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1296#L441 assume !(0 != start_simulation_~tmp~3); 1300#L424-1 [2021-08-27 16:30:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,046 INFO L82 PathProgramCache]: Analyzing trace with hash 151897971, now seen corresponding path program 1 times [2021-08-27 16:30:04,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887480741] [2021-08-27 16:30:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887480741] [2021-08-27 16:30:04,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887480741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86852435] [2021-08-27 16:30:04,081 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 6 times [2021-08-27 16:30:04,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678929609] [2021-08-27 16:30:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678929609] [2021-08-27 16:30:04,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678929609] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651106102] [2021-08-27 16:30:04,122 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,123 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. cyclomatic complexity: 62 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,130 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2021-08-27 16:30:04,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 161 transitions. [2021-08-27 16:30:04,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 161 transitions. [2021-08-27 16:30:04,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:04,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:04,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 161 transitions. [2021-08-27 16:30:04,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,134 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2021-08-27 16:30:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 161 transitions. [2021-08-27 16:30:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5940594059405941) internal successors, (161), 100 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2021-08-27 16:30:04,142 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2021-08-27 16:30:04,142 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 161 transitions. [2021-08-27 16:30:04,142 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 16:30:04,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 161 transitions. [2021-08-27 16:30:04,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,144 INFO L842 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] [2021-08-27 16:30:04,146 INFO L843 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] [2021-08-27 16:30:04,146 INFO L791 eck$LassoCheckResult]: Stem: 1594#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; 1540#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; 1541#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; 1557#L204 assume 1 == ~b0_req_up~0; 1584#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1504#L129-2 ~b0_req_up~0 := 0; 1505#L204-1 assume 1 == ~b1_req_up~0; 1502#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1503#L144-2 ~b1_req_up~0 := 0; 1567#L211 assume 1 == ~d0_req_up~0; 1569#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1570#L159-2 ~d0_req_up~0 := 0; 1542#L218 assume 1 == ~d1_req_up~0; 1543#L174 assume !(~d1_val~0 != ~d1_val_t~0); 1588#L174-2 ~d1_req_up~0 := 0; 1532#L225 assume !(1 == ~z_req_up~0); 1533#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1590#L247-1 assume !(0 == ~b0_ev~0); 1591#L313-1 assume !(0 == ~b1_ev~0); 1560#L318-1 assume !(0 == ~d0_ev~0); 1561#L323-1 assume !(0 == ~d1_ev~0); 1571#L328-1 assume !(0 == ~z_ev~0); 1572#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; 1585#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1513#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1520#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1552#L382 assume !(0 != activate_threads_~tmp~1); 1508#L382-2 assume !(1 == ~b0_ev~0); 1509#L346-1 assume !(1 == ~b1_ev~0); 1516#L351-1 assume !(1 == ~d0_ev~0); 1521#L356-1 assume !(1 == ~d1_ev~0); 1510#L361-1 assume !(1 == ~z_ev~0); 1511#L424-1 [2021-08-27 16:30:04,147 INFO L793 eck$LassoCheckResult]: Loop: 1511#L424-1 assume !false; 1583#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; 1558#L287 assume !false; 1559#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1562#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1519#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1514#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1495#L282 assume !(0 != eval_~tmp___0~0); 1497#L303 start_simulation_~kernel_st~0 := 2; 1579#L204-2 assume !(1 == ~b0_req_up~0); 1553#L204-3 assume !(1 == ~b1_req_up~0); 1548#L211-1 assume !(1 == ~d0_req_up~0); 1536#L218-1 assume !(1 == ~d1_req_up~0); 1515#L225-1 assume !(1 == ~z_req_up~0); 1577#L232-1 start_simulation_~kernel_st~0 := 3; 1581#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1573#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1574#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1576#L323-3 assume !(0 == ~d1_ev~0); 1595#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1566#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; 1550#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1545#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1549#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1522#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1523#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1555#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1556#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1575#L356-3 assume !(1 == ~d1_ev~0); 1498#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1499#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; 1568#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1530#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1531#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1564#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1539#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1506#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1507#L441 assume !(0 != start_simulation_~tmp~3); 1511#L424-1 [2021-08-27 16:30:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash -650688005, now seen corresponding path program 1 times [2021-08-27 16:30:04,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237389030] [2021-08-27 16:30:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237389030] [2021-08-27 16:30:04,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237389030] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:30:04,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805975952] [2021-08-27 16:30:04,200 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 7 times [2021-08-27 16:30:04,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463038124] [2021-08-27 16:30:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463038124] [2021-08-27 16:30:04,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463038124] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102635050] [2021-08-27 16:30:04,239 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:30:04,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:30:04,240 INFO L87 Difference]: Start difference. First operand 101 states and 161 transitions. cyclomatic complexity: 61 Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,263 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2021-08-27 16:30:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:30:04,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 160 transitions. [2021-08-27 16:30:04,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 160 transitions. [2021-08-27 16:30:04,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:04,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:04,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 160 transitions. [2021-08-27 16:30:04,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,269 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2021-08-27 16:30:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 160 transitions. [2021-08-27 16:30:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 100 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2021-08-27 16:30:04,280 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2021-08-27 16:30:04,280 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 160 transitions. [2021-08-27 16:30:04,280 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 16:30:04,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 160 transitions. [2021-08-27 16:30:04,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,283 INFO L842 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] [2021-08-27 16:30:04,283 INFO L843 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] [2021-08-27 16:30:04,284 INFO L791 eck$LassoCheckResult]: Stem: 1808#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; 1754#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; 1755#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; 1771#L204 assume 1 == ~b0_req_up~0; 1798#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1718#L129-2 ~b0_req_up~0 := 0; 1719#L204-1 assume 1 == ~b1_req_up~0; 1716#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1717#L144-2 ~b1_req_up~0 := 0; 1781#L211 assume 1 == ~d0_req_up~0; 1783#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1784#L159-2 ~d0_req_up~0 := 0; 1756#L218 assume 1 == ~d1_req_up~0; 1757#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 1802#L174-2 ~d1_req_up~0 := 0; 1746#L225 assume !(1 == ~z_req_up~0); 1747#L232 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 1804#L247-1 assume !(0 == ~b0_ev~0); 1805#L313-1 assume !(0 == ~b1_ev~0); 1774#L318-1 assume !(0 == ~d0_ev~0); 1775#L323-1 assume !(0 == ~d1_ev~0); 1785#L328-1 assume !(0 == ~z_ev~0); 1786#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; 1799#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1727#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1734#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1766#L382 assume !(0 != activate_threads_~tmp~1); 1722#L382-2 assume !(1 == ~b0_ev~0); 1723#L346-1 assume !(1 == ~b1_ev~0); 1730#L351-1 assume !(1 == ~d0_ev~0); 1735#L356-1 assume !(1 == ~d1_ev~0); 1724#L361-1 assume !(1 == ~z_ev~0); 1725#L424-1 [2021-08-27 16:30:04,284 INFO L793 eck$LassoCheckResult]: Loop: 1725#L424-1 assume !false; 1797#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; 1772#L287 assume !false; 1773#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1776#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1733#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1728#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1709#L282 assume !(0 != eval_~tmp___0~0); 1711#L303 start_simulation_~kernel_st~0 := 2; 1793#L204-2 assume !(1 == ~b0_req_up~0); 1767#L204-3 assume !(1 == ~b1_req_up~0); 1762#L211-1 assume !(1 == ~d0_req_up~0); 1750#L218-1 assume !(1 == ~d1_req_up~0); 1729#L225-1 assume !(1 == ~z_req_up~0); 1791#L232-1 start_simulation_~kernel_st~0 := 3; 1795#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1787#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1788#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1790#L323-3 assume !(0 == ~d1_ev~0); 1809#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1780#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; 1764#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1759#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1763#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1736#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1737#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1769#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1770#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1789#L356-3 assume !(1 == ~d1_ev~0); 1712#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1713#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; 1782#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1744#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1745#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1778#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1753#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1720#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1721#L441 assume !(0 != start_simulation_~tmp~3); 1725#L424-1 [2021-08-27 16:30:04,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1038255737, now seen corresponding path program 1 times [2021-08-27 16:30:04,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619538118] [2021-08-27 16:30:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619538118] [2021-08-27 16:30:04,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619538118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:30:04,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714734087] [2021-08-27 16:30:04,325 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 8 times [2021-08-27 16:30:04,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550388770] [2021-08-27 16:30:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550388770] [2021-08-27 16:30:04,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550388770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168481602] [2021-08-27 16:30:04,350 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:30:04,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:30:04,351 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. cyclomatic complexity: 60 Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,367 INFO L93 Difference]: Finished difference Result 101 states and 159 transitions. [2021-08-27 16:30:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:30:04,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 159 transitions. [2021-08-27 16:30:04,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 159 transitions. [2021-08-27 16:30:04,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-08-27 16:30:04,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2021-08-27 16:30:04,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 159 transitions. [2021-08-27 16:30:04,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,369 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2021-08-27 16:30:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 159 transitions. [2021-08-27 16:30:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-08-27 16:30:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 100 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2021-08-27 16:30:04,371 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2021-08-27 16:30:04,371 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 159 transitions. [2021-08-27 16:30:04,371 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 16:30:04,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 159 transitions. [2021-08-27 16:30:04,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2021-08-27 16:30:04,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,372 INFO L842 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] [2021-08-27 16:30:04,372 INFO L843 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] [2021-08-27 16:30:04,372 INFO L791 eck$LassoCheckResult]: Stem: 2022#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; 1968#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; 1969#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; 1985#L204 assume 1 == ~b0_req_up~0; 2012#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1932#L129-2 ~b0_req_up~0 := 0; 1933#L204-1 assume 1 == ~b1_req_up~0; 1930#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1931#L144-2 ~b1_req_up~0 := 0; 1995#L211 assume 1 == ~d0_req_up~0; 1997#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 1998#L159-2 ~d0_req_up~0 := 0; 1970#L218 assume 1 == ~d1_req_up~0; 1971#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2016#L174-2 ~d1_req_up~0 := 0; 1960#L225 assume !(1 == ~z_req_up~0); 1961#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2018#L247-1 assume !(0 == ~b0_ev~0); 2019#L313-1 assume !(0 == ~b1_ev~0); 1988#L318-1 assume !(0 == ~d0_ev~0); 1989#L323-1 assume !(0 == ~d1_ev~0); 1999#L328-1 assume !(0 == ~z_ev~0); 2000#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; 2013#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1941#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1948#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1980#L382 assume !(0 != activate_threads_~tmp~1); 1936#L382-2 assume !(1 == ~b0_ev~0); 1937#L346-1 assume !(1 == ~b1_ev~0); 1944#L351-1 assume !(1 == ~d0_ev~0); 1949#L356-1 assume !(1 == ~d1_ev~0); 1938#L361-1 assume !(1 == ~z_ev~0); 1939#L424-1 [2021-08-27 16:30:04,372 INFO L793 eck$LassoCheckResult]: Loop: 1939#L424-1 assume !false; 2011#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; 1986#L287 assume !false; 1987#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 1990#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1947#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1942#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 1923#L282 assume !(0 != eval_~tmp___0~0); 1925#L303 start_simulation_~kernel_st~0 := 2; 2007#L204-2 assume !(1 == ~b0_req_up~0); 1981#L204-3 assume !(1 == ~b1_req_up~0); 1976#L211-1 assume !(1 == ~d0_req_up~0); 1964#L218-1 assume !(1 == ~d1_req_up~0); 1943#L225-1 assume !(1 == ~z_req_up~0); 2005#L232-1 start_simulation_~kernel_st~0 := 3; 2009#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2001#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2002#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2004#L323-3 assume !(0 == ~d1_ev~0); 2023#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1994#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; 1978#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 1973#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 1977#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1950#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 1951#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1983#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1984#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2003#L356-3 assume !(1 == ~d1_ev~0); 1926#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1927#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; 1996#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 1958#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 1959#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 1992#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1967#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 1934#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 1935#L441 assume !(0 != start_simulation_~tmp~3); 1939#L424-1 [2021-08-27 16:30:04,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash 17187383, now seen corresponding path program 1 times [2021-08-27 16:30:04,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471579654] [2021-08-27 16:30:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471579654] [2021-08-27 16:30:04,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471579654] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522488644] [2021-08-27 16:30:04,399 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 9 times [2021-08-27 16:30:04,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432843837] [2021-08-27 16:30:04,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432843837] [2021-08-27 16:30:04,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432843837] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216929049] [2021-08-27 16:30:04,432 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,432 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,451 INFO L93 Difference]: Finished difference Result 116 states and 181 transitions. [2021-08-27 16:30:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2021-08-27 16:30:04,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2021-08-27 16:30:04,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 181 transitions. [2021-08-27 16:30:04,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2021-08-27 16:30:04,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2021-08-27 16:30:04,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 181 transitions. [2021-08-27 16:30:04,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,453 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2021-08-27 16:30:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 181 transitions. [2021-08-27 16:30:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-08-27 16:30:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.5603448275862069) internal successors, (181), 115 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2021-08-27 16:30:04,455 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2021-08-27 16:30:04,455 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2021-08-27 16:30:04,455 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 16:30:04,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 181 transitions. [2021-08-27 16:30:04,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2021-08-27 16:30:04,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,456 INFO L842 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] [2021-08-27 16:30:04,456 INFO L843 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] [2021-08-27 16:30:04,456 INFO L791 eck$LassoCheckResult]: Stem: 2250#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; 2194#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; 2195#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; 2211#L204 assume 1 == ~b0_req_up~0; 2243#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2158#L129-2 ~b0_req_up~0 := 0; 2159#L204-1 assume 1 == ~b1_req_up~0; 2156#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2157#L144-2 ~b1_req_up~0 := 0; 2221#L211 assume 1 == ~d0_req_up~0; 2223#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2224#L159-2 ~d0_req_up~0 := 0; 2196#L218 assume 1 == ~d1_req_up~0; 2197#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2244#L174-2 ~d1_req_up~0 := 0; 2186#L225 assume !(1 == ~z_req_up~0); 2187#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2246#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2247#L313-1 assume !(0 == ~b1_ev~0); 2214#L318-1 assume !(0 == ~d0_ev~0); 2215#L323-1 assume !(0 == ~d1_ev~0); 2225#L328-1 assume !(0 == ~z_ev~0); 2226#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; 2240#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2167#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2174#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2206#L382 assume !(0 != activate_threads_~tmp~1); 2162#L382-2 assume !(1 == ~b0_ev~0); 2163#L346-1 assume !(1 == ~b1_ev~0); 2170#L351-1 assume !(1 == ~d0_ev~0); 2175#L356-1 assume !(1 == ~d1_ev~0); 2164#L361-1 assume !(1 == ~z_ev~0); 2165#L424-1 [2021-08-27 16:30:04,456 INFO L793 eck$LassoCheckResult]: Loop: 2165#L424-1 assume !false; 2239#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; 2212#L287 assume !false; 2213#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2216#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2173#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2168#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2149#L282 assume !(0 != eval_~tmp___0~0); 2151#L303 start_simulation_~kernel_st~0 := 2; 2233#L204-2 assume !(1 == ~b0_req_up~0); 2235#L204-3 assume !(1 == ~b1_req_up~0); 2261#L211-1 assume !(1 == ~d0_req_up~0); 2258#L218-1 assume !(1 == ~d1_req_up~0); 2255#L225-1 assume !(1 == ~z_req_up~0); 2253#L232-1 start_simulation_~kernel_st~0 := 3; 2252#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2227#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2228#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2230#L323-3 assume !(0 == ~d1_ev~0); 2251#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2220#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; 2204#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2199#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2203#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2176#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2177#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2209#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2210#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2229#L356-3 assume !(1 == ~d1_ev~0); 2152#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2153#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; 2222#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2184#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2185#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2218#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2193#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2160#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2161#L441 assume !(0 != start_simulation_~tmp~3); 2165#L424-1 [2021-08-27 16:30:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1297051061, now seen corresponding path program 1 times [2021-08-27 16:30:04,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573724587] [2021-08-27 16:30:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573724587] [2021-08-27 16:30:04,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573724587] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955170217] [2021-08-27 16:30:04,475 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 10 times [2021-08-27 16:30:04,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415876483] [2021-08-27 16:30:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415876483] [2021-08-27 16:30:04,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415876483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481576513] [2021-08-27 16:30:04,502 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,502 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. cyclomatic complexity: 66 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,518 INFO L93 Difference]: Finished difference Result 141 states and 218 transitions. [2021-08-27 16:30:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 218 transitions. [2021-08-27 16:30:04,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2021-08-27 16:30:04,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 141 states and 218 transitions. [2021-08-27 16:30:04,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2021-08-27 16:30:04,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2021-08-27 16:30:04,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 218 transitions. [2021-08-27 16:30:04,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,520 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2021-08-27 16:30:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 218 transitions. [2021-08-27 16:30:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-08-27 16:30:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.5460992907801419) internal successors, (218), 140 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 218 transitions. [2021-08-27 16:30:04,522 INFO L704 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2021-08-27 16:30:04,522 INFO L587 BuchiCegarLoop]: Abstraction has 141 states and 218 transitions. [2021-08-27 16:30:04,522 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 16:30:04,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 218 transitions. [2021-08-27 16:30:04,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 104 [2021-08-27 16:30:04,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,524 INFO L842 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] [2021-08-27 16:30:04,524 INFO L843 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] [2021-08-27 16:30:04,524 INFO L791 eck$LassoCheckResult]: Stem: 2520#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; 2460#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; 2461#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; 2478#L204 assume 1 == ~b0_req_up~0; 2511#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2424#L129-2 ~b0_req_up~0 := 0; 2425#L204-1 assume 1 == ~b1_req_up~0; 2422#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2423#L144-2 ~b1_req_up~0 := 0; 2488#L211 assume 1 == ~d0_req_up~0; 2490#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2491#L159-2 ~d0_req_up~0 := 0; 2462#L218 assume 1 == ~d1_req_up~0; 2463#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2514#L174-2 ~d1_req_up~0 := 0; 2454#L225 assume !(1 == ~z_req_up~0); 2455#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2516#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2517#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2481#L318-1 assume !(0 == ~d0_ev~0); 2482#L323-1 assume !(0 == ~d1_ev~0); 2495#L328-1 assume !(0 == ~z_ev~0); 2496#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; 2512#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2433#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2440#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2472#L382 assume !(0 != activate_threads_~tmp~1); 2428#L382-2 assume !(1 == ~b0_ev~0); 2429#L346-1 assume !(1 == ~b1_ev~0); 2436#L351-1 assume !(1 == ~d0_ev~0); 2441#L356-1 assume !(1 == ~d1_ev~0); 2430#L361-1 assume !(1 == ~z_ev~0); 2431#L424-1 [2021-08-27 16:30:04,524 INFO L793 eck$LassoCheckResult]: Loop: 2431#L424-1 assume !false; 2509#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; 2479#L287 assume !false; 2480#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2483#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2439#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2434#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2415#L282 assume !(0 != eval_~tmp___0~0); 2417#L303 start_simulation_~kernel_st~0 := 2; 2503#L204-2 assume !(1 == ~b0_req_up~0); 2505#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; 2524#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2522#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2498#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2500#L323-3 assume !(0 == ~d1_ev~0); 2521#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2487#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; 2470#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2465#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2469#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2442#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2443#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2476#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2477#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2499#L356-3 assume !(1 == ~d1_ev~0); 2418#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2419#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; 2489#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2450#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2451#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2485#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2459#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2426#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2427#L441 assume !(0 != start_simulation_~tmp~3); 2431#L424-1 [2021-08-27 16:30:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1986798985, now seen corresponding path program 1 times [2021-08-27 16:30:04,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441813652] [2021-08-27 16:30:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441813652] [2021-08-27 16:30:04,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441813652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211695431] [2021-08-27 16:30:04,547 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 11 times [2021-08-27 16:30:04,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408160162] [2021-08-27 16:30:04,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408160162] [2021-08-27 16:30:04,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408160162] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984832072] [2021-08-27 16:30:04,585 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,586 INFO L87 Difference]: Start difference. First operand 141 states and 218 transitions. cyclomatic complexity: 78 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,603 INFO L93 Difference]: Finished difference Result 180 states and 275 transitions. [2021-08-27 16:30:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 275 transitions. [2021-08-27 16:30:04,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2021-08-27 16:30:04,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 275 transitions. [2021-08-27 16:30:04,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2021-08-27 16:30:04,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2021-08-27 16:30:04,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 275 transitions. [2021-08-27 16:30:04,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,606 INFO L681 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2021-08-27 16:30:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 275 transitions. [2021-08-27 16:30:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-08-27 16:30:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.5277777777777777) internal successors, (275), 179 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2021-08-27 16:30:04,608 INFO L704 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2021-08-27 16:30:04,609 INFO L587 BuchiCegarLoop]: Abstraction has 180 states and 275 transitions. [2021-08-27 16:30:04,609 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 16:30:04,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 275 transitions. [2021-08-27 16:30:04,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2021-08-27 16:30:04,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,610 INFO L842 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] [2021-08-27 16:30:04,610 INFO L843 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] [2021-08-27 16:30:04,610 INFO L791 eck$LassoCheckResult]: Stem: 2854#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; 2790#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; 2791#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; 2808#L204 assume 1 == ~b0_req_up~0; 2840#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2754#L129-2 ~b0_req_up~0 := 0; 2755#L204-1 assume 1 == ~b1_req_up~0; 2752#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2753#L144-2 ~b1_req_up~0 := 0; 2818#L211 assume 1 == ~d0_req_up~0; 2820#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2821#L159-2 ~d0_req_up~0 := 0; 2792#L218 assume 1 == ~d1_req_up~0; 2793#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 2847#L174-2 ~d1_req_up~0 := 0; 2782#L225 assume !(1 == ~z_req_up~0); 2783#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2849#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2850#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2811#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2812#L323-1 assume !(0 == ~d1_ev~0); 2823#L328-1 assume !(0 == ~z_ev~0); 2824#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; 2841#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2763#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2770#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2803#L382 assume !(0 != activate_threads_~tmp~1); 2758#L382-2 assume !(1 == ~b0_ev~0); 2759#L346-1 assume !(1 == ~b1_ev~0); 2766#L351-1 assume !(1 == ~d0_ev~0); 2771#L356-1 assume !(1 == ~d1_ev~0); 2760#L361-1 assume !(1 == ~z_ev~0); 2761#L424-1 [2021-08-27 16:30:04,610 INFO L793 eck$LassoCheckResult]: Loop: 2761#L424-1 assume !false; 2839#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; 2809#L287 assume !false; 2810#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 2813#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2769#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2764#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 2745#L282 assume !(0 != eval_~tmp___0~0); 2747#L303 start_simulation_~kernel_st~0 := 2; 2832#L204-2 assume !(1 == ~b0_req_up~0); 2834#L204-3 assume !(1 == ~b1_req_up~0); 2879#L211-1 assume !(1 == ~d0_req_up~0); 2873#L218-1 assume !(1 == ~d1_req_up~0); 2867#L225-1 assume !(1 == ~z_req_up~0); 2864#L232-1 start_simulation_~kernel_st~0 := 3; 2861#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2859#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2857#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2828#L323-3 assume !(0 == ~d1_ev~0); 2855#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2817#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; 2801#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 2796#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 2800#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2772#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 2773#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2806#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2807#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2827#L356-3 assume !(1 == ~d1_ev~0); 2748#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2749#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; 2819#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 2780#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 2781#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 2815#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2789#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 2756#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 2757#L441 assume !(0 != start_simulation_~tmp~3); 2761#L424-1 [2021-08-27 16:30:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1399992971, now seen corresponding path program 1 times [2021-08-27 16:30:04,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804322791] [2021-08-27 16:30:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804322791] [2021-08-27 16:30:04,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804322791] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849484] [2021-08-27 16:30:04,626 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 12 times [2021-08-27 16:30:04,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813017858] [2021-08-27 16:30:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813017858] [2021-08-27 16:30:04,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813017858] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347870094] [2021-08-27 16:30:04,652 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,652 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,669 INFO L93 Difference]: Finished difference Result 235 states and 352 transitions. [2021-08-27 16:30:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 352 transitions. [2021-08-27 16:30:04,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2021-08-27 16:30:04,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 235 states and 352 transitions. [2021-08-27 16:30:04,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2021-08-27 16:30:04,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2021-08-27 16:30:04,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 352 transitions. [2021-08-27 16:30:04,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,673 INFO L681 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2021-08-27 16:30:04,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 352 transitions. [2021-08-27 16:30:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-08-27 16:30:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 234 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 352 transitions. [2021-08-27 16:30:04,676 INFO L704 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2021-08-27 16:30:04,677 INFO L587 BuchiCegarLoop]: Abstraction has 235 states and 352 transitions. [2021-08-27 16:30:04,677 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 16:30:04,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 352 transitions. [2021-08-27 16:30:04,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 198 [2021-08-27 16:30:04,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,678 INFO L842 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] [2021-08-27 16:30:04,678 INFO L843 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] [2021-08-27 16:30:04,679 INFO L791 eck$LassoCheckResult]: Stem: 3281#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; 3216#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; 3217#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; 3236#L204 assume 1 == ~b0_req_up~0; 3269#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 3179#L129-2 ~b0_req_up~0 := 0; 3180#L204-1 assume 1 == ~b1_req_up~0; 3177#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 3178#L144-2 ~b1_req_up~0 := 0; 3246#L211 assume 1 == ~d0_req_up~0; 3248#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 3249#L159-2 ~d0_req_up~0 := 0; 3218#L218 assume 1 == ~d1_req_up~0; 3219#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 3275#L174-2 ~d1_req_up~0 := 0; 3208#L225 assume !(1 == ~z_req_up~0); 3209#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 3277#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3278#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3239#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3240#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 3251#L328-1 assume !(0 == ~z_ev~0); 3252#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; 3270#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3188#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3196#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3230#L382 assume !(0 != activate_threads_~tmp~1); 3183#L382-2 assume !(1 == ~b0_ev~0); 3184#L346-1 assume !(1 == ~b1_ev~0); 3192#L351-1 assume !(1 == ~d0_ev~0); 3197#L356-1 assume !(1 == ~d1_ev~0); 3185#L361-1 assume !(1 == ~z_ev~0); 3186#L424-1 [2021-08-27 16:30:04,679 INFO L793 eck$LassoCheckResult]: Loop: 3186#L424-1 assume !false; 3268#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; 3237#L287 assume !false; 3238#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 3241#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3195#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3189#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 3169#L282 assume !(0 != eval_~tmp___0~0); 3171#L303 start_simulation_~kernel_st~0 := 2; 3260#L204-2 assume !(1 == ~b0_req_up~0); 3262#L204-3 assume !(1 == ~b1_req_up~0); 3309#L211-1 assume !(1 == ~d0_req_up~0); 3303#L218-1 assume !(1 == ~d1_req_up~0); 3297#L225-1 assume !(1 == ~z_req_up~0); 3294#L232-1 start_simulation_~kernel_st~0 := 3; 3291#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3287#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3285#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3283#L323-3 assume !(0 == ~d1_ev~0); 3282#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 3245#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; 3228#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 3223#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 3225#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3198#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 3199#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3234#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 3235#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 3255#L356-3 assume !(1 == ~d1_ev~0); 3172#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 3173#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; 3247#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 3206#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 3207#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 3242#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3215#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 3181#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 3182#L441 assume !(0 != start_simulation_~tmp~3); 3186#L424-1 [2021-08-27 16:30:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1658158409, now seen corresponding path program 1 times [2021-08-27 16:30:04,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759395371] [2021-08-27 16:30:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759395371] [2021-08-27 16:30:04,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759395371] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 16:30:04,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560833232] [2021-08-27 16:30:04,718 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 13 times [2021-08-27 16:30:04,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538475908] [2021-08-27 16:30:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538475908] [2021-08-27 16:30:04,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538475908] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944549245] [2021-08-27 16:30:04,755 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 16:30:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 16:30:04,756 INFO L87 Difference]: Start difference. First operand 235 states and 352 transitions. cyclomatic complexity: 118 Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,812 INFO L93 Difference]: Finished difference Result 633 states and 958 transitions. [2021-08-27 16:30:04,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 16:30:04,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 633 states and 958 transitions. [2021-08-27 16:30:04,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 583 [2021-08-27 16:30:04,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 633 states to 633 states and 958 transitions. [2021-08-27 16:30:04,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 633 [2021-08-27 16:30:04,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 633 [2021-08-27 16:30:04,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 633 states and 958 transitions. [2021-08-27 16:30:04,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,820 INFO L681 BuchiCegarLoop]: Abstraction has 633 states and 958 transitions. [2021-08-27 16:30:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states and 958 transitions. [2021-08-27 16:30:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 241. [2021-08-27 16:30:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 241 states have (on average 1.4854771784232366) internal successors, (358), 240 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 358 transitions. [2021-08-27 16:30:04,824 INFO L704 BuchiCegarLoop]: Abstraction has 241 states and 358 transitions. [2021-08-27 16:30:04,824 INFO L587 BuchiCegarLoop]: Abstraction has 241 states and 358 transitions. [2021-08-27 16:30:04,824 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 16:30:04,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 358 transitions. [2021-08-27 16:30:04,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 201 [2021-08-27 16:30:04,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,826 INFO L842 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] [2021-08-27 16:30:04,826 INFO L843 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] [2021-08-27 16:30:04,826 INFO L791 eck$LassoCheckResult]: Stem: 4168#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; 4101#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; 4102#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; 4122#L204 assume 1 == ~b0_req_up~0; 4154#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4063#L129-2 ~b0_req_up~0 := 0; 4064#L204-1 assume 1 == ~b1_req_up~0; 4061#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4062#L144-2 ~b1_req_up~0 := 0; 4132#L211 assume 1 == ~d0_req_up~0; 4134#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4135#L159-2 ~d0_req_up~0 := 0; 4103#L218 assume 1 == ~d1_req_up~0; 4104#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4160#L174-2 ~d1_req_up~0 := 0; 4093#L225 assume !(1 == ~z_req_up~0); 4094#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4163#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4164#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4125#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4126#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4137#L328-1 assume !(0 == ~z_ev~0); 4138#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; 4155#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4072#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4293#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4166#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4067#L382-2 assume !(1 == ~b0_ev~0); 4068#L346-1 assume !(1 == ~b1_ev~0); 4077#L351-1 assume !(1 == ~d0_ev~0); 4082#L356-1 assume !(1 == ~d1_ev~0); 4069#L361-1 assume !(1 == ~z_ev~0); 4070#L424-1 [2021-08-27 16:30:04,826 INFO L793 eck$LassoCheckResult]: Loop: 4070#L424-1 assume !false; 4153#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; 4123#L287 assume !false; 4124#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4127#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4080#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4074#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 4053#L282 assume !(0 != eval_~tmp___0~0); 4055#L303 start_simulation_~kernel_st~0 := 2; 4146#L204-2 assume !(1 == ~b0_req_up~0); 4148#L204-3 assume !(1 == ~b1_req_up~0); 4196#L211-1 assume !(1 == ~d0_req_up~0); 4190#L218-1 assume !(1 == ~d1_req_up~0); 4184#L225-1 assume !(1 == ~z_req_up~0); 4181#L232-1 start_simulation_~kernel_st~0 := 3; 4178#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4174#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4172#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4170#L323-3 assume !(0 == ~d1_ev~0); 4169#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 4131#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; 4114#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4108#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4152#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4083#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4084#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4120#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4121#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4141#L356-3 assume !(1 == ~d1_ev~0); 4056#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4057#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; 4133#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4091#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4092#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 4129#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4100#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 4065#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 4066#L441 assume !(0 != start_simulation_~tmp~3); 4070#L424-1 [2021-08-27 16:30:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1715416711, now seen corresponding path program 1 times [2021-08-27 16:30:04,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475446666] [2021-08-27 16:30:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475446666] [2021-08-27 16:30:04,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475446666] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552443330] [2021-08-27 16:30:04,844 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1726026488, now seen corresponding path program 14 times [2021-08-27 16:30:04,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826914309] [2021-08-27 16:30:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826914309] [2021-08-27 16:30:04,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826914309] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263463057] [2021-08-27 16:30:04,868 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,868 INFO L87 Difference]: Start difference. First operand 241 states and 358 transitions. cyclomatic complexity: 118 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,887 INFO L93 Difference]: Finished difference Result 256 states and 375 transitions. [2021-08-27 16:30:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 375 transitions. [2021-08-27 16:30:04,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2021-08-27 16:30:04,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 256 states and 375 transitions. [2021-08-27 16:30:04,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2021-08-27 16:30:04,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2021-08-27 16:30:04,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 375 transitions. [2021-08-27 16:30:04,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,891 INFO L681 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2021-08-27 16:30:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 375 transitions. [2021-08-27 16:30:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-08-27 16:30:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 256 states have (on average 1.46484375) internal successors, (375), 255 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2021-08-27 16:30:04,894 INFO L704 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2021-08-27 16:30:04,894 INFO L587 BuchiCegarLoop]: Abstraction has 256 states and 375 transitions. [2021-08-27 16:30:04,894 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 16:30:04,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 375 transitions. [2021-08-27 16:30:04,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2021-08-27 16:30:04,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,895 INFO L842 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] [2021-08-27 16:30:04,896 INFO L843 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] [2021-08-27 16:30:04,896 INFO L791 eck$LassoCheckResult]: Stem: 4673#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; 4605#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; 4606#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; 4625#L204 assume 1 == ~b0_req_up~0; 4661#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 4569#L129-2 ~b0_req_up~0 := 0; 4570#L204-1 assume 1 == ~b1_req_up~0; 4567#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 4568#L144-2 ~b1_req_up~0 := 0; 4636#L211 assume 1 == ~d0_req_up~0; 4638#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 4639#L159-2 ~d0_req_up~0 := 0; 4607#L218 assume 1 == ~d1_req_up~0; 4608#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 4667#L174-2 ~d1_req_up~0 := 0; 4597#L225 assume !(1 == ~z_req_up~0); 4598#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 4670#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 4671#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4628#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4629#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 4642#L328-1 assume !(0 == ~z_ev~0); 4643#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; 4662#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4584#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4585#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4619#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4573#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4574#L346-1 assume !(1 == ~b1_ev~0); 4580#L351-1 assume !(1 == ~d0_ev~0); 4586#L356-1 assume !(1 == ~d1_ev~0); 4575#L361-1 assume !(1 == ~z_ev~0); 4576#L424-1 [2021-08-27 16:30:04,896 INFO L793 eck$LassoCheckResult]: Loop: 4576#L424-1 assume !false; 4660#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; 4626#L287 assume !false; 4627#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 4630#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4583#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4577#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 4559#L282 assume !(0 != eval_~tmp___0~0); 4561#L303 start_simulation_~kernel_st~0 := 2; 4652#L204-2 assume !(1 == ~b0_req_up~0); 4620#L204-3 assume !(1 == ~b1_req_up~0); 4622#L211-1 assume !(1 == ~d0_req_up~0); 4756#L218-1 assume !(1 == ~d1_req_up~0); 4701#L225-1 assume !(1 == ~z_req_up~0); 4697#L232-1 start_simulation_~kernel_st~0 := 3; 4690#L313-2 assume !(0 == ~b0_ev~0); 4687#L313-4 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 4684#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 4681#L323-3 assume !(0 == ~d1_ev~0); 4674#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 4634#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; 4635#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 4617#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 4615#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4587#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 4588#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 4623#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 4624#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 4646#L356-3 assume !(1 == ~d1_ev~0); 4562#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 4563#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; 4637#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 4595#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 4596#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 4632#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4604#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 4571#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 4572#L441 assume !(0 != start_simulation_~tmp~3); 4576#L424-1 [2021-08-27 16:30:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1717263753, now seen corresponding path program 1 times [2021-08-27 16:30:04,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215265965] [2021-08-27 16:30:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215265965] [2021-08-27 16:30:04,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215265965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742649784] [2021-08-27 16:30:04,914 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash 763502474, now seen corresponding path program 1 times [2021-08-27 16:30:04,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924475735] [2021-08-27 16:30:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924475735] [2021-08-27 16:30:04,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924475735] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681674128] [2021-08-27 16:30:04,947 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,947 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. cyclomatic complexity: 120 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,965 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2021-08-27 16:30:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 412 transitions. [2021-08-27 16:30:04,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2021-08-27 16:30:04,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 284 states and 412 transitions. [2021-08-27 16:30:04,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2021-08-27 16:30:04,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2021-08-27 16:30:04,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 412 transitions. [2021-08-27 16:30:04,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,968 INFO L681 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2021-08-27 16:30:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 412 transitions. [2021-08-27 16:30:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-08-27 16:30:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 284 states have (on average 1.4507042253521127) internal successors, (412), 283 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions. [2021-08-27 16:30:04,972 INFO L704 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2021-08-27 16:30:04,972 INFO L587 BuchiCegarLoop]: Abstraction has 284 states and 412 transitions. [2021-08-27 16:30:04,972 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 16:30:04,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 284 states and 412 transitions. [2021-08-27 16:30:04,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 250 [2021-08-27 16:30:04,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,974 INFO L842 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] [2021-08-27 16:30:04,974 INFO L843 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] [2021-08-27 16:30:04,974 INFO L791 eck$LassoCheckResult]: Stem: 5217#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; 5153#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; 5154#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; 5174#L204 assume 1 == ~b0_req_up~0; 5206#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 5118#L129-2 ~b0_req_up~0 := 0; 5119#L204-1 assume 1 == ~b1_req_up~0; 5116#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 5117#L144-2 ~b1_req_up~0 := 0; 5184#L211 assume 1 == ~d0_req_up~0; 5186#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 5187#L159-2 ~d0_req_up~0 := 0; 5155#L218 assume 1 == ~d1_req_up~0; 5156#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 5211#L174-2 ~d1_req_up~0 := 0; 5145#L225 assume !(1 == ~z_req_up~0); 5146#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 5214#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 5215#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 5177#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5178#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 5189#L328-1 assume !(0 == ~z_ev~0); 5190#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; 5207#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5132#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5133#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5168#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5122#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5123#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5128#L351-1 assume !(1 == ~d0_ev~0); 5134#L356-1 assume !(1 == ~d1_ev~0); 5124#L361-1 assume !(1 == ~z_ev~0); 5125#L424-1 [2021-08-27 16:30:04,974 INFO L793 eck$LassoCheckResult]: Loop: 5125#L424-1 assume !false; 5205#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; 5175#L287 assume !false; 5176#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5179#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5131#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5126#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 5108#L282 assume !(0 != eval_~tmp___0~0); 5110#L303 start_simulation_~kernel_st~0 := 2; 5198#L204-2 assume !(1 == ~b0_req_up~0); 5200#L204-3 assume !(1 == ~b1_req_up~0); 5252#L211-1 assume !(1 == ~d0_req_up~0); 5249#L218-1 assume !(1 == ~d1_req_up~0); 5245#L225-1 assume !(1 == ~z_req_up~0); 5240#L232-1 start_simulation_~kernel_st~0 := 3; 5237#L313-2 assume !(0 == ~b0_ev~0); 5233#L313-4 assume !(0 == ~b1_ev~0); 5230#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5225#L323-3 assume !(0 == ~d1_ev~0); 5224#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; 5221#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5222#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5327#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5325#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5323#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5322#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5173#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5193#L356-3 assume !(1 == ~d1_ev~0); 5111#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 5112#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; 5185#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5143#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5144#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 5181#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5152#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 5120#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 5121#L441 assume !(0 != start_simulation_~tmp~3); 5125#L424-1 [2021-08-27 16:30:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1717323335, now seen corresponding path program 1 times [2021-08-27 16:30:04,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978838586] [2021-08-27 16:30:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978838586] [2021-08-27 16:30:04,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978838586] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971756385] [2021-08-27 16:30:04,991 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash 982357192, now seen corresponding path program 1 times [2021-08-27 16:30:04,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23692070] [2021-08-27 16:30:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:05,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:05,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23692070] [2021-08-27 16:30:05,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23692070] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:05,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:05,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:05,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493180907] [2021-08-27 16:30:05,015 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:05,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:05,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:05,015 INFO L87 Difference]: Start difference. First operand 284 states and 412 transitions. cyclomatic complexity: 129 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:05,029 INFO L93 Difference]: Finished difference Result 326 states and 467 transitions. [2021-08-27 16:30:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:05,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 467 transitions. [2021-08-27 16:30:05,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 292 [2021-08-27 16:30:05,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 326 states and 467 transitions. [2021-08-27 16:30:05,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 326 [2021-08-27 16:30:05,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2021-08-27 16:30:05,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 326 states and 467 transitions. [2021-08-27 16:30:05,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:05,033 INFO L681 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2021-08-27 16:30:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 467 transitions. [2021-08-27 16:30:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2021-08-27 16:30:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 326 states have (on average 1.4325153374233128) internal successors, (467), 325 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 467 transitions. [2021-08-27 16:30:05,037 INFO L704 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2021-08-27 16:30:05,037 INFO L587 BuchiCegarLoop]: Abstraction has 326 states and 467 transitions. [2021-08-27 16:30:05,037 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 16:30:05,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 467 transitions. [2021-08-27 16:30:05,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 292 [2021-08-27 16:30:05,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:05,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:05,039 INFO L842 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] [2021-08-27 16:30:05,039 INFO L843 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] [2021-08-27 16:30:05,040 INFO L791 eck$LassoCheckResult]: Stem: 5837#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; 5773#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; 5774#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; 5792#L204 assume 1 == ~b0_req_up~0; 5826#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 5737#L129-2 ~b0_req_up~0 := 0; 5738#L204-1 assume 1 == ~b1_req_up~0; 5735#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 5736#L144-2 ~b1_req_up~0 := 0; 5802#L211 assume 1 == ~d0_req_up~0; 5804#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 5805#L159-2 ~d0_req_up~0 := 0; 5775#L218 assume 1 == ~d1_req_up~0; 5776#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 5830#L174-2 ~d1_req_up~0 := 0; 5765#L225 assume !(1 == ~z_req_up~0); 5766#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 5834#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 5835#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 5795#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5796#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 5807#L328-1 assume !(0 == ~z_ev~0); 5808#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; 5827#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5752#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5753#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5786#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5741#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5742#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5748#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5754#L356-1 assume !(1 == ~d1_ev~0); 5743#L361-1 assume !(1 == ~z_ev~0); 5744#L424-1 [2021-08-27 16:30:05,040 INFO L793 eck$LassoCheckResult]: Loop: 5744#L424-1 assume !false; 5825#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; 5793#L287 assume !false; 5794#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 5797#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5751#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5745#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 5727#L282 assume !(0 != eval_~tmp___0~0); 5729#L303 start_simulation_~kernel_st~0 := 2; 5817#L204-2 assume !(1 == ~b0_req_up~0); 5819#L204-3 assume !(1 == ~b1_req_up~0); 5879#L211-1 assume !(1 == ~d0_req_up~0); 5875#L218-1 assume !(1 == ~d1_req_up~0); 5876#L225-1 assume !(1 == ~z_req_up~0); 5904#L232-1 start_simulation_~kernel_st~0 := 3; 5901#L313-2 assume !(0 == ~b0_ev~0); 5897#L313-4 assume !(0 == ~b1_ev~0); 5894#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 5863#L323-3 assume !(0 == ~d1_ev~0); 5861#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 5858#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; 5855#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 5856#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 5953#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5951#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 5918#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 5913#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 5791#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 5811#L356-3 assume !(1 == ~d1_ev~0); 5730#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 5731#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; 5803#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 5763#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 5764#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 5798#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5772#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 5739#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 5740#L441 assume !(0 != start_simulation_~tmp~3); 5744#L424-1 [2021-08-27 16:30:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325257, now seen corresponding path program 1 times [2021-08-27 16:30:05,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364489389] [2021-08-27 16:30:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:05,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:05,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364489389] [2021-08-27 16:30:05,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364489389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:05,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:05,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:05,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002884985] [2021-08-27 16:30:05,062 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash 982357192, now seen corresponding path program 2 times [2021-08-27 16:30:05,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63164153] [2021-08-27 16:30:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:05,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:05,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63164153] [2021-08-27 16:30:05,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63164153] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:05,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:05,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:05,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543962233] [2021-08-27 16:30:05,086 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:05,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:05,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:05,087 INFO L87 Difference]: Start difference. First operand 326 states and 467 transitions. cyclomatic complexity: 142 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:05,104 INFO L93 Difference]: Finished difference Result 393 states and 555 transitions. [2021-08-27 16:30:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:05,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 555 transitions. [2021-08-27 16:30:05,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2021-08-27 16:30:05,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 393 states and 555 transitions. [2021-08-27 16:30:05,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2021-08-27 16:30:05,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 393 [2021-08-27 16:30:05,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 393 states and 555 transitions. [2021-08-27 16:30:05,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:05,108 INFO L681 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2021-08-27 16:30:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states and 555 transitions. [2021-08-27 16:30:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2021-08-27 16:30:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 393 states have (on average 1.4122137404580153) internal successors, (555), 392 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 555 transitions. [2021-08-27 16:30:05,118 INFO L704 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2021-08-27 16:30:05,118 INFO L587 BuchiCegarLoop]: Abstraction has 393 states and 555 transitions. [2021-08-27 16:30:05,118 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 16:30:05,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 393 states and 555 transitions. [2021-08-27 16:30:05,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2021-08-27 16:30:05,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:05,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:05,120 INFO L842 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] [2021-08-27 16:30:05,120 INFO L843 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] [2021-08-27 16:30:05,120 INFO L791 eck$LassoCheckResult]: Stem: 6562#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; 6500#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; 6501#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; 6519#L204 assume 1 == ~b0_req_up~0; 6551#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 6465#L129-2 ~b0_req_up~0 := 0; 6466#L204-1 assume 1 == ~b1_req_up~0; 6463#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 6464#L144-2 ~b1_req_up~0 := 0; 6529#L211 assume 1 == ~d0_req_up~0; 6531#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 6532#L159-2 ~d0_req_up~0 := 0; 6502#L218 assume 1 == ~d1_req_up~0; 6503#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 6556#L174-2 ~d1_req_up~0 := 0; 6494#L225 assume !(1 == ~z_req_up~0); 6495#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 6559#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 6560#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 6522#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 6523#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 6534#L328-1 assume !(0 == ~z_ev~0); 6535#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; 6552#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6479#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6480#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6513#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6469#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6470#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6475#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6481#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 6471#L361-1 assume !(1 == ~z_ev~0); 6472#L424-1 [2021-08-27 16:30:05,120 INFO L793 eck$LassoCheckResult]: Loop: 6472#L424-1 assume !false; 6548#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; 6520#L287 assume !false; 6521#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 6524#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6478#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6473#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 6455#L282 assume !(0 != eval_~tmp___0~0); 6457#L303 start_simulation_~kernel_st~0 := 2; 6542#L204-2 assume !(1 == ~b0_req_up~0); 6544#L204-3 assume !(1 == ~b1_req_up~0); 6617#L211-1 assume !(1 == ~d0_req_up~0); 6613#L218-1 assume !(1 == ~d1_req_up~0); 6609#L225-1 assume !(1 == ~z_req_up~0); 6606#L232-1 start_simulation_~kernel_st~0 := 3; 6604#L313-2 assume !(0 == ~b0_ev~0); 6601#L313-4 assume !(0 == ~b1_ev~0); 6598#L318-3 assume !(0 == ~d0_ev~0); 6596#L323-3 assume !(0 == ~d1_ev~0); 6594#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 6592#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; 6589#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 6590#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 6603#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6600#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 6573#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 6570#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6568#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6566#L356-3 assume !(1 == ~d1_ev~0); 6458#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 6459#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; 6530#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 6490#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 6491#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 6525#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6499#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 6467#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 6468#L441 assume !(0 != start_simulation_~tmp~3); 6472#L424-1 [2021-08-27 16:30:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 1 times [2021-08-27 16:30:05,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287660137] [2021-08-27 16:30:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,127 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1405059018, now seen corresponding path program 1 times [2021-08-27 16:30:05,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963899322] [2021-08-27 16:30:05,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:05,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:05,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963899322] [2021-08-27 16:30:05,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963899322] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:05,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:05,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:05,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370963430] [2021-08-27 16:30:05,173 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:05,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:30:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:30:05,173 INFO L87 Difference]: Start difference. First operand 393 states and 555 transitions. cyclomatic complexity: 163 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:05,222 INFO L93 Difference]: Finished difference Result 426 states and 602 transitions. [2021-08-27 16:30:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 16:30:05,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 602 transitions. [2021-08-27 16:30:05,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 392 [2021-08-27 16:30:05,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 426 states and 602 transitions. [2021-08-27 16:30:05,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 426 [2021-08-27 16:30:05,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426 [2021-08-27 16:30:05,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 426 states and 602 transitions. [2021-08-27 16:30:05,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:05,226 INFO L681 BuchiCegarLoop]: Abstraction has 426 states and 602 transitions. [2021-08-27 16:30:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states and 602 transitions. [2021-08-27 16:30:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 396. [2021-08-27 16:30:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 1.4090909090909092) internal successors, (558), 395 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 558 transitions. [2021-08-27 16:30:05,231 INFO L704 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2021-08-27 16:30:05,231 INFO L587 BuchiCegarLoop]: Abstraction has 396 states and 558 transitions. [2021-08-27 16:30:05,231 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-27 16:30:05,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 558 transitions. [2021-08-27 16:30:05,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 362 [2021-08-27 16:30:05,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:05,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:05,233 INFO L842 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] [2021-08-27 16:30:05,233 INFO L843 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] [2021-08-27 16:30:05,233 INFO L791 eck$LassoCheckResult]: Stem: 7405#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; 7336#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; 7337#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; 7356#L204 assume 1 == ~b0_req_up~0; 7394#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 7299#L129-2 ~b0_req_up~0 := 0; 7300#L204-1 assume 1 == ~b1_req_up~0; 7297#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 7298#L144-2 ~b1_req_up~0 := 0; 7368#L211 assume 1 == ~d0_req_up~0; 7370#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 7371#L159-2 ~d0_req_up~0 := 0; 7338#L218 assume 1 == ~d1_req_up~0; 7339#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 7399#L174-2 ~d1_req_up~0 := 0; 7328#L225 assume !(1 == ~z_req_up~0); 7329#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 7402#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 7403#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 7359#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7360#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 7373#L328-1 assume !(0 == ~z_ev~0); 7374#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; 7395#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7315#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7316#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 7350#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7303#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7304#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7310#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7317#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 7305#L361-1 assume !(1 == ~z_ev~0); 7306#L424-1 [2021-08-27 16:30:05,233 INFO L793 eck$LassoCheckResult]: Loop: 7306#L424-1 assume !false; 7393#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; 7357#L287 assume !false; 7358#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 7361#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 7313#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7314#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 7412#L282 assume !(0 != eval_~tmp___0~0); 7408#L303 start_simulation_~kernel_st~0 := 2; 7384#L204-2 assume !(1 == ~b0_req_up~0); 7386#L204-3 assume !(1 == ~b1_req_up~0); 7510#L211-1 assume !(1 == ~d0_req_up~0); 7511#L218-1 assume !(1 == ~d1_req_up~0); 7473#L225-1 assume !(1 == ~z_req_up~0); 7470#L232-1 start_simulation_~kernel_st~0 := 3; 7467#L313-2 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 7463#L313-4 assume !(0 == ~b1_ev~0); 7459#L318-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7460#L323-3 assume !(0 == ~d1_ev~0); 7532#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 7530#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; 7528#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 7482#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 7525#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 7522#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 7437#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7432#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 7413#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 7411#L356-3 assume !(1 == ~d1_ev~0); 7292#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 7293#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; 7369#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 7326#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 7327#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 7363#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7335#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 7301#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 7302#L441 assume !(0 != start_simulation_~tmp~3); 7306#L424-1 [2021-08-27 16:30:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325319, now seen corresponding path program 2 times [2021-08-27 16:30:05,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206285599] [2021-08-27 16:30:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,240 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,256 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash 543812228, now seen corresponding path program 1 times [2021-08-27 16:30:05,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800843471] [2021-08-27 16:30:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,260 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,266 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,267 INFO L82 PathProgramCache]: Analyzing trace with hash -877632900, now seen corresponding path program 1 times [2021-08-27 16:30:05,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556432698] [2021-08-27 16:30:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:05,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:05,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556432698] [2021-08-27 16:30:05,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556432698] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:05,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:05,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:05,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091538470] [2021-08-27 16:30:05,710 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:30:05,710 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:30:05,710 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:30:05,710 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:30:05,710 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:30:05,711 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:05,711 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:30:05,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:30:05,711 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration20_Loop [2021-08-27 16:30:05,711 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:30:05,711 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:30:05,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:05,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:30:06,006 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:30:06,007 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 16:30:06,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:06,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:06,031 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:06,031 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d1_ev~0=-7} Honda state: {~d1_ev~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:30:06,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 16:30:06,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:06,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:06,063 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:06,064 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Honda state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:30:06,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 16:30:06,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:06,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:06,117 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:06,117 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: [] [2021-08-27 16:30:06,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,135 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 16:30:06,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:06,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:06,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,195 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,196 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 16:30:06,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:30:06,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:06,239 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:30:06,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,257 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:30:06,257 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:30:06,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:30:06,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:30:06,257 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:30:06,257 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,257 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:30:06,257 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:30:06,257 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration20_Loop [2021-08-27 16:30:06,257 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:30:06,257 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:30:06,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:06,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:30:06,552 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:30:06,553 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 16:30:06,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:06,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:06,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:06,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:06,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:06,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:06,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:06,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:06,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:06,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,672 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 16:30:06,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:06,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:06,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:06,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:06,682 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:30:06,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:06,683 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:30:06,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:06,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:06,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,707 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,707 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 16:30:06,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:06,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:06,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:06,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:06,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:06,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:06,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:06,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:06,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:06,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,762 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:06,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:06,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:06,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:06,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:06,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:06,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:06,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:06,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 16:30:06,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:06,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,805 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,806 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 16:30:06,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:06,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:06,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:06,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:06,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:06,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:06,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:06,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:06,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:06,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,849 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 16:30:06,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:06,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:06,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:06,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:06,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:06,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:06,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:06,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:06,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:30:06,867 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:30:06,867 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:30:06,868 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:06,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:06,870 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:06,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 16:30:06,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:30:06,873 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:30:06,873 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:30:06,873 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b0_ev~0) = -1*~b0_ev~0 + 1 Supporting invariants [] [2021-08-27 16:30:06,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:06,936 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:30:06,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:07,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:30:07,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:30:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:07,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:30:07,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:30:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:07,351 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 [2021-08-27 16:30:07,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163 Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 558 transitions. cyclomatic complexity: 163. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1350 states and 1928 transitions. Complement of second has 5 states. [2021-08-27 16:30:07,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 16:30:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2021-08-27 16:30:07,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 252 transitions. Stem has 32 letters. Loop has 38 letters. [2021-08-27 16:30:07,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:30:07,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 252 transitions. Stem has 70 letters. Loop has 38 letters. [2021-08-27 16:30:07,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:30:07,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 252 transitions. Stem has 32 letters. Loop has 76 letters. [2021-08-27 16:30:07,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:30:07,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1350 states and 1928 transitions. [2021-08-27 16:30:07,419 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 937 [2021-08-27 16:30:07,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1350 states to 1278 states and 1828 transitions. [2021-08-27 16:30:07,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 972 [2021-08-27 16:30:07,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 977 [2021-08-27 16:30:07,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1278 states and 1828 transitions. [2021-08-27 16:30:07,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:07,426 INFO L681 BuchiCegarLoop]: Abstraction has 1278 states and 1828 transitions. [2021-08-27 16:30:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states and 1828 transitions. [2021-08-27 16:30:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 911. [2021-08-27 16:30:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 911 states have (on average 1.4281009879253568) internal successors, (1301), 910 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1301 transitions. [2021-08-27 16:30:07,440 INFO L704 BuchiCegarLoop]: Abstraction has 911 states and 1301 transitions. [2021-08-27 16:30:07,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:07,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:07,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:07,440 INFO L87 Difference]: Start difference. First operand 911 states and 1301 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:07,462 INFO L93 Difference]: Finished difference Result 969 states and 1379 transitions. [2021-08-27 16:30:07,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:07,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 969 states and 1379 transitions. [2021-08-27 16:30:07,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2021-08-27 16:30:07,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 969 states to 969 states and 1379 transitions. [2021-08-27 16:30:07,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 648 [2021-08-27 16:30:07,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 648 [2021-08-27 16:30:07,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 969 states and 1379 transitions. [2021-08-27 16:30:07,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:07,473 INFO L681 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2021-08-27 16:30:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states and 1379 transitions. [2021-08-27 16:30:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2021-08-27 16:30:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 969 states have (on average 1.4231166150670795) internal successors, (1379), 968 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1379 transitions. [2021-08-27 16:30:07,486 INFO L704 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2021-08-27 16:30:07,486 INFO L587 BuchiCegarLoop]: Abstraction has 969 states and 1379 transitions. [2021-08-27 16:30:07,486 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-27 16:30:07,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 969 states and 1379 transitions. [2021-08-27 16:30:07,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 613 [2021-08-27 16:30:07,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:07,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:07,490 INFO L842 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] [2021-08-27 16:30:07,490 INFO L843 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] [2021-08-27 16:30:07,490 INFO L791 eck$LassoCheckResult]: Stem: 11349#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; 11226#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; 11227#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; 11260#L204 assume 1 == ~b0_req_up~0; 11332#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 11165#L129-2 ~b0_req_up~0 := 0; 11166#L204-1 assume 1 == ~b1_req_up~0; 11163#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 11164#L144-2 ~b1_req_up~0 := 0; 11278#L211 assume 1 == ~d0_req_up~0; 11283#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 11284#L159-2 ~d0_req_up~0 := 0; 11228#L218 assume 1 == ~d1_req_up~0; 11229#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 11337#L174-2 ~d1_req_up~0 := 0; 11217#L225 assume !(1 == ~z_req_up~0); 11218#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 11344#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 11345#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 11265#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 11266#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 11287#L328-1 assume !(0 == ~z_ev~0); 11288#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; 11333#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11190#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 11191#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 11249#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11171#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11172#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11183#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11192#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 11173#L361-1 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11174#L424-1 [2021-08-27 16:30:07,491 INFO L793 eck$LassoCheckResult]: Loop: 11174#L424-1 assume !false; 11740#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; 11734#L287 assume !false; 11739#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11738#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11705#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11737#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 11736#L282 assume 0 != eval_~tmp___0~0; 11735#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 11598#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; 11733#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 11730#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 11728#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 11727#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 11725#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 11342#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 11261#L287 assume !false; 11262#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 11365#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 11703#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11701#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 11383#L282 assume !(0 != eval_~tmp___0~0); 11354#L303 start_simulation_~kernel_st~0 := 2; 11355#L204-2 assume !(1 == ~b0_req_up~0); 11689#L204-3 assume !(1 == ~b1_req_up~0); 11686#L211-1 assume !(1 == ~d0_req_up~0); 11683#L218-1 assume !(1 == ~d1_req_up~0); 11677#L225-1 assume !(1 == ~z_req_up~0); 11674#L232-1 start_simulation_~kernel_st~0 := 3; 11671#L313-2 assume !(0 == ~b0_ev~0); 11667#L313-4 assume !(0 == ~b1_ev~0); 11663#L318-3 assume !(0 == ~d0_ev~0); 11659#L323-3 assume !(0 == ~d1_ev~0); 11657#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 11655#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; 11652#L99-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 11653#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 11699#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 11639#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 11622#L382-5 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 11619#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 11616#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 11613#L356-3 assume !(1 == ~d1_ev~0); 11614#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 11753#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; 11747#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 11746#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 11745#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 11744#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11743#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 11742#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 11741#L441 assume !(0 != start_simulation_~tmp~3); 11174#L424-1 [2021-08-27 16:30:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1717325321, now seen corresponding path program 1 times [2021-08-27 16:30:07,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036145279] [2021-08-27 16:30:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:07,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:07,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036145279] [2021-08-27 16:30:07,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036145279] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:07,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:07,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:30:07,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350135747] [2021-08-27 16:30:07,509 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:07,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash -696899428, now seen corresponding path program 1 times [2021-08-27 16:30:07,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479948424] [2021-08-27 16:30:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:07,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:07,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479948424] [2021-08-27 16:30:07,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479948424] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:07,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:07,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:07,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592627273] [2021-08-27 16:30:07,523 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:07,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:07,524 INFO L87 Difference]: Start difference. First operand 969 states and 1379 transitions. cyclomatic complexity: 413 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:07,549 INFO L93 Difference]: Finished difference Result 1921 states and 2691 transitions. [2021-08-27 16:30:07,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:07,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1921 states and 2691 transitions. [2021-08-27 16:30:07,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2021-08-27 16:30:07,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1921 states to 1921 states and 2691 transitions. [2021-08-27 16:30:07,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2021-08-27 16:30:07,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2021-08-27 16:30:07,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1921 states and 2691 transitions. [2021-08-27 16:30:07,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:07,566 INFO L681 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2021-08-27 16:30:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states and 2691 transitions. [2021-08-27 16:30:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2021-08-27 16:30:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1921 states have (on average 1.400832899531494) internal successors, (2691), 1920 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2691 transitions. [2021-08-27 16:30:07,588 INFO L704 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2021-08-27 16:30:07,588 INFO L587 BuchiCegarLoop]: Abstraction has 1921 states and 2691 transitions. [2021-08-27 16:30:07,588 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-27 16:30:07,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1921 states and 2691 transitions. [2021-08-27 16:30:07,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2021-08-27 16:30:07,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:07,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:07,595 INFO L842 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] [2021-08-27 16:30:07,595 INFO L843 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] [2021-08-27 16:30:07,595 INFO L791 eck$LassoCheckResult]: Stem: 14262#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; 14124#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; 14125#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; 14159#L204 assume 1 == ~b0_req_up~0; 14243#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 14062#L129-2 ~b0_req_up~0 := 0; 14063#L204-1 assume 1 == ~b1_req_up~0; 14060#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 14061#L144-2 ~b1_req_up~0 := 0; 14181#L211 assume 1 == ~d0_req_up~0; 14188#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 14189#L159-2 ~d0_req_up~0 := 0; 14126#L218 assume 1 == ~d1_req_up~0; 14127#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 14249#L174-2 ~d1_req_up~0 := 0; 14115#L225 assume !(1 == ~z_req_up~0); 14116#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 14256#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 14257#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 14164#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 14165#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 14193#L328-1 assume !(0 == ~z_ev~0); 14194#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; 14399#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 14398#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 14397#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 14396#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 14395#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 14394#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 14393#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 14392#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 14391#L361-1 assume !(1 == ~z_ev~0); 14389#L424-1 assume !false; 14390#L425 [2021-08-27 16:30:07,595 INFO L793 eck$LassoCheckResult]: Loop: 14390#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; 15073#L287 assume !false; 15085#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 15083#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 14982#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 15080#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 15077#L282 assume 0 != eval_~tmp___0~0; 15076#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 15044#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; 15066#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 15062#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 15053#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 15048#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 15042#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 14988#L287 assume !false; 14984#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 14981#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 14979#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 14976#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 14973#L282 assume !(0 != eval_~tmp___0~0); 14972#L303 start_simulation_~kernel_st~0 := 2; 14959#L204-2 assume !(1 == ~b0_req_up~0); 14955#L204-3 assume !(1 == ~b1_req_up~0); 14952#L211-1 assume !(1 == ~d0_req_up~0); 14941#L218-1 assume !(1 == ~d1_req_up~0); 14933#L225-1 assume !(1 == ~z_req_up~0); 14928#L232-1 start_simulation_~kernel_st~0 := 3; 14926#L313-2 assume !(0 == ~b0_ev~0); 14922#L313-4 assume !(0 == ~b1_ev~0); 14918#L318-3 assume !(0 == ~d0_ev~0); 14914#L323-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 14915#L328-3 assume !(0 == ~z_ev~0); 15576#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; 15572#L99-1 assume !(1 == ~b0_ev~0); 15569#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 14132#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 15797#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 15588#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 15587#L382-5 assume !(1 == ~b0_ev~0); 14879#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 14880#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 14859#L356-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 14854#L361-3 assume !(1 == ~z_ev~0); 14852#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; 15106#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 15075#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 15103#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 15101#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 15098#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 15095#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 15092#L441 assume !(0 != start_simulation_~tmp~3); 15090#L424-1 assume !false; 14390#L425 [2021-08-27 16:30:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 1 times [2021-08-27 16:30:07,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266028552] [2021-08-27 16:30:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,601 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,608 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash -819356584, now seen corresponding path program 1 times [2021-08-27 16:30:07,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208009477] [2021-08-27 16:30:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:07,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:07,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208009477] [2021-08-27 16:30:07,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208009477] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:07,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:07,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:07,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908620740] [2021-08-27 16:30:07,621 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:07,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:07,622 INFO L87 Difference]: Start difference. First operand 1921 states and 2691 transitions. cyclomatic complexity: 773 Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:07,649 INFO L93 Difference]: Finished difference Result 3753 states and 5233 transitions. [2021-08-27 16:30:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:07,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3753 states and 5233 transitions. [2021-08-27 16:30:07,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2428 [2021-08-27 16:30:07,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3753 states to 3753 states and 5233 transitions. [2021-08-27 16:30:07,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2481 [2021-08-27 16:30:07,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2481 [2021-08-27 16:30:07,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3753 states and 5233 transitions. [2021-08-27 16:30:07,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:07,681 INFO L681 BuchiCegarLoop]: Abstraction has 3753 states and 5233 transitions. [2021-08-27 16:30:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states and 5233 transitions. [2021-08-27 16:30:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 1939. [2021-08-27 16:30:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1939 states have (on average 1.3971119133574008) internal successors, (2709), 1938 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2709 transitions. [2021-08-27 16:30:07,723 INFO L704 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2021-08-27 16:30:07,723 INFO L587 BuchiCegarLoop]: Abstraction has 1939 states and 2709 transitions. [2021-08-27 16:30:07,723 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-27 16:30:07,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1939 states and 2709 transitions. [2021-08-27 16:30:07,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1238 [2021-08-27 16:30:07,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:07,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:07,729 INFO L842 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] [2021-08-27 16:30:07,729 INFO L843 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] [2021-08-27 16:30:07,729 INFO L791 eck$LassoCheckResult]: Stem: 19961#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; 19807#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; 19808#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; 19841#L204 assume 1 == ~b0_req_up~0; 19936#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 19742#L129-2 ~b0_req_up~0 := 0; 19743#L204-1 assume 1 == ~b1_req_up~0; 19740#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 19741#L144-2 ~b1_req_up~0 := 0; 19870#L211 assume 1 == ~d0_req_up~0; 19881#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 19882#L159-2 ~d0_req_up~0 := 0; 19809#L218 assume 1 == ~d1_req_up~0; 19810#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 19945#L174-2 ~d1_req_up~0 := 0; 19797#L225 assume !(1 == ~z_req_up~0); 19798#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 19953#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 19954#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 19846#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 19847#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 19887#L328-1 assume !(0 == ~z_ev~0); 19888#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; 19937#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 19938#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 19830#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 19831#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 19748#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 19749#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 19771#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 19772#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 19750#L361-1 assume !(1 == ~z_ev~0); 19751#L424-1 assume !false; 20248#L425 [2021-08-27 16:30:07,729 INFO L793 eck$LassoCheckResult]: Loop: 20248#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; 20732#L287 assume !false; 20764#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 20761#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 20714#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20755#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 20738#L282 assume 0 != eval_~tmp___0~0; 20734#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 20719#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; 20731#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 20729#L44-1 assume 0 != ~d0_val~0; 20727#L54 assume 0 != ~b1_val~0;method1_~s2~0 := 0; 20725#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 20724#L65-2 assume !(0 != method1_~s2~0);method1_~s2~0 := 0; 20722#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 20717#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 20716#L287 assume !false; 20715#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 20713#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 20537#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20535#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 20536#L282 assume !(0 != eval_~tmp___0~0); 20695#L303 start_simulation_~kernel_st~0 := 2; 20688#L204-2 assume !(1 == ~b0_req_up~0); 20659#L204-3 assume !(1 == ~b1_req_up~0); 20655#L211-1 assume !(1 == ~d0_req_up~0); 20651#L218-1 assume !(1 == ~d1_req_up~0); 20648#L225-1 assume !(1 == ~z_req_up~0); 20649#L232-1 start_simulation_~kernel_st~0 := 3; 20856#L313-2 assume !(0 == ~b0_ev~0); 20853#L313-4 assume !(0 == ~b1_ev~0); 20850#L318-3 assume !(0 == ~d0_ev~0); 20847#L323-3 assume !(0 == ~d1_ev~0); 20844#L328-3 assume !(0 == ~z_ev~0); 20842#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; 20840#L99-1 assume !(1 == ~b0_ev~0); 20837#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 20838#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 21203#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 21201#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 21199#L382-5 assume !(1 == ~b0_ev~0); 20809#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 20801#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 20794#L356-3 assume !(1 == ~d1_ev~0); 20790#L361-3 assume !(1 == ~z_ev~0); 20788#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; 20784#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 20782#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 20780#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 20778#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 20777#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 20775#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 20773#L441 assume !(0 != start_simulation_~tmp~3); 20771#L424-1 assume !false; 20248#L425 [2021-08-27 16:30:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 2 times [2021-08-27 16:30:07,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782440790] [2021-08-27 16:30:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,735 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:07,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,741 INFO L82 PathProgramCache]: Analyzing trace with hash -614486231, now seen corresponding path program 1 times [2021-08-27 16:30:07,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816948197] [2021-08-27 16:30:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:07,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:07,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816948197] [2021-08-27 16:30:07,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816948197] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:07,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:07,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:07,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516341675] [2021-08-27 16:30:07,753 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:07,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:07,753 INFO L87 Difference]: Start difference. First operand 1939 states and 2709 transitions. cyclomatic complexity: 773 Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:07,776 INFO L93 Difference]: Finished difference Result 3747 states and 5203 transitions. [2021-08-27 16:30:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:07,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3747 states and 5203 transitions. [2021-08-27 16:30:07,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2424 [2021-08-27 16:30:07,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3747 states to 3747 states and 5203 transitions. [2021-08-27 16:30:07,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2477 [2021-08-27 16:30:07,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2477 [2021-08-27 16:30:07,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3747 states and 5203 transitions. [2021-08-27 16:30:07,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:07,807 INFO L681 BuchiCegarLoop]: Abstraction has 3747 states and 5203 transitions. [2021-08-27 16:30:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states and 5203 transitions. [2021-08-27 16:30:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 1939. [2021-08-27 16:30:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1939 states have (on average 1.3878287777204745) internal successors, (2691), 1938 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2691 transitions. [2021-08-27 16:30:07,834 INFO L704 BuchiCegarLoop]: Abstraction has 1939 states and 2691 transitions. [2021-08-27 16:30:07,834 INFO L587 BuchiCegarLoop]: Abstraction has 1939 states and 2691 transitions. [2021-08-27 16:30:07,834 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-27 16:30:07,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1939 states and 2691 transitions. [2021-08-27 16:30:07,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1238 [2021-08-27 16:30:07,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:07,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:07,839 INFO L842 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] [2021-08-27 16:30:07,839 INFO L843 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] [2021-08-27 16:30:07,840 INFO L791 eck$LassoCheckResult]: Stem: 25653#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; 25500#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; 25501#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; 25535#L204 assume 1 == ~b0_req_up~0; 25631#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 25434#L129-2 ~b0_req_up~0 := 0; 25435#L204-1 assume 1 == ~b1_req_up~0; 25432#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 25433#L144-2 ~b1_req_up~0 := 0; 25565#L211 assume 1 == ~d0_req_up~0; 25573#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 25574#L159-2 ~d0_req_up~0 := 0; 25502#L218 assume 1 == ~d1_req_up~0; 25503#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 25638#L174-2 ~d1_req_up~0 := 0; 25490#L225 assume !(1 == ~z_req_up~0); 25491#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 25646#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 25647#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 25540#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 25541#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 25577#L328-1 assume !(0 == ~z_ev~0); 25578#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; 25634#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 25462#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 25463#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 25651#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 25652#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 25453#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 25454#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 25466#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 25467#L361-1 assume !(1 == ~z_ev~0); 25947#L424-1 assume !false; 25948#L425 [2021-08-27 16:30:07,840 INFO L793 eck$LassoCheckResult]: Loop: 25948#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; 25587#L287 assume !false; 26782#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 25548#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 25549#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26231#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 25418#L282 assume 0 != eval_~tmp___0~0; 25419#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 25554#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; 25588#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 25571#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 25560#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 25688#L65-2 assume 0 != method1_~s2~0; 25689#L72 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 25569#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 25456#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 26470#L287 assume !false; 26469#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; 26465#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26463#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 26459#L282 assume !(0 != eval_~tmp___0~0); 26457#L303 start_simulation_~kernel_st~0 := 2; 26453#L204-2 assume !(1 == ~b0_req_up~0); 26451#L204-3 assume !(1 == ~b1_req_up~0); 26452#L211-1 assume !(1 == ~d0_req_up~0); 26565#L218-1 assume !(1 == ~d1_req_up~0); 26561#L225-1 assume !(1 == ~z_req_up~0); 26562#L232-1 start_simulation_~kernel_st~0 := 3; 26858#L313-2 assume !(0 == ~b0_ev~0); 26855#L313-4 assume !(0 == ~b1_ev~0); 26852#L318-3 assume !(0 == ~d0_ev~0); 26849#L323-3 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 26850#L328-3 assume !(0 == ~z_ev~0); 26973#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; 26971#L99-1 assume !(1 == ~b0_ev~0); 26969#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 26904#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 26902#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 26900#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 26898#L382-5 assume !(1 == ~b0_ev~0); 26339#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 26261#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 26252#L356-3 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 26247#L361-3 assume !(1 == ~z_ev~0); 26248#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; 26797#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 26625#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 26795#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 26794#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 26793#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 26791#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 26789#L441 assume !(0 != start_simulation_~tmp~3); 26786#L424-1 assume !false; 25948#L425 [2021-08-27 16:30:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 3 times [2021-08-27 16:30:07,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375665367] [2021-08-27 16:30:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,845 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,851 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1567847802, now seen corresponding path program 1 times [2021-08-27 16:30:07,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415712762] [2021-08-27 16:30:07,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:07,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:07,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415712762] [2021-08-27 16:30:07,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415712762] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:07,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:07,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:07,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618842860] [2021-08-27 16:30:07,863 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:07,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:07,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:07,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:07,863 INFO L87 Difference]: Start difference. First operand 1939 states and 2691 transitions. cyclomatic complexity: 755 Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:07,881 INFO L93 Difference]: Finished difference Result 2427 states and 3367 transitions. [2021-08-27 16:30:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:07,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2427 states and 3367 transitions. [2021-08-27 16:30:07,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1588 [2021-08-27 16:30:07,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2427 states to 2427 states and 3367 transitions. [2021-08-27 16:30:07,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1641 [2021-08-27 16:30:07,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1641 [2021-08-27 16:30:07,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2427 states and 3367 transitions. [2021-08-27 16:30:07,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:07,895 INFO L681 BuchiCegarLoop]: Abstraction has 2427 states and 3367 transitions. [2021-08-27 16:30:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states and 3367 transitions. [2021-08-27 16:30:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2295. [2021-08-27 16:30:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2295 states have (on average 1.3886710239651416) internal successors, (3187), 2294 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3187 transitions. [2021-08-27 16:30:07,920 INFO L704 BuchiCegarLoop]: Abstraction has 2295 states and 3187 transitions. [2021-08-27 16:30:07,920 INFO L587 BuchiCegarLoop]: Abstraction has 2295 states and 3187 transitions. [2021-08-27 16:30:07,920 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-08-27 16:30:07,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2295 states and 3187 transitions. [2021-08-27 16:30:07,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1500 [2021-08-27 16:30:07,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:07,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:07,926 INFO L842 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] [2021-08-27 16:30:07,926 INFO L843 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] [2021-08-27 16:30:07,926 INFO L791 eck$LassoCheckResult]: Stem: 30018#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; 29873#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; 29874#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; 29908#L204 assume 1 == ~b0_req_up~0; 29994#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 29806#L129-2 ~b0_req_up~0 := 0; 29807#L204-1 assume 1 == ~b1_req_up~0; 29804#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 29805#L144-2 ~b1_req_up~0 := 0; 29938#L211 assume 1 == ~d0_req_up~0; 29942#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 29943#L159-2 ~d0_req_up~0 := 0; 29875#L218 assume 1 == ~d1_req_up~0; 29876#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 30002#L174-2 ~d1_req_up~0 := 0; 29863#L225 assume !(1 == ~z_req_up~0); 29864#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 30010#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 30011#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 29913#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 29914#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 29947#L328-1 assume !(0 == ~z_ev~0); 29948#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; 29997#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 29835#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 29836#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 30016#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 30017#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 29827#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 29828#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 29839#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 29840#L361-1 assume !(1 == ~z_ev~0); 30671#L424-1 assume !false; 29988#L425 [2021-08-27 16:30:07,926 INFO L793 eck$LassoCheckResult]: Loop: 29988#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; 29909#L287 assume !false; 29910#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 29921#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 29833#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 29820#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 29790#L282 assume 0 != eval_~tmp___0~0; 29791#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 29926#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; 29849#L44 assume !(0 != ~b0_val~0);method1_~s1~0 := 1; 29850#L44-1 assume !(0 != ~d0_val~0);method1_~s2~0 := 1; 29845#L53 assume 0 != method1_~s2~0;method1_~s3~0 := 0; 29846#L65-2 assume 0 != method1_~s2~0; 29915#L72 assume 0 != method1_~s1~0;method1_~s2~0 := 1; 29916#L71 assume 0 != method1_~s2~0;~z_val_t~0 := 0; 29830#L83-2 ~z_req_up~0 := 1;~comp_m1_st~0 := 2; 31080#L287 assume !false; 31078#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 31075#L260 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1 := 0; 31073#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 31071#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 31067#L282 assume !(0 != eval_~tmp___0~0); 31065#L303 start_simulation_~kernel_st~0 := 2; 31061#L204-2 assume !(1 == ~b0_req_up~0); 31062#L204-3 assume !(1 == ~b1_req_up~0); 31536#L211-1 assume !(1 == ~d0_req_up~0); 31516#L218-1 assume !(1 == ~d1_req_up~0); 31510#L225-1 assume 1 == ~z_req_up~0; 31221#L189-3 assume ~z_val~0 != ~z_val_t~0;~z_val~0 := ~z_val_t~0;~z_ev~0 := 0; 31504#L189-5 ~z_req_up~0 := 0; 31533#L232-1 start_simulation_~kernel_st~0 := 3; 31532#L313-2 assume !(0 == ~b0_ev~0); 31529#L313-4 assume !(0 == ~b1_ev~0); 31527#L318-3 assume !(0 == ~d0_ev~0); 31525#L323-3 assume !(0 == ~d1_ev~0); 31521#L328-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 31514#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; 31508#L99-1 assume !(1 == ~b0_ev~0); 31500#L103-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0 := 1; 31501#L121-1 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 31804#L122-1 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 31799#L382-3 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 31795#L382-5 assume !(1 == ~b0_ev~0); 31781#L346-3 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 30684#L351-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 30678#L356-3 assume !(1 == ~d1_ev~0); 29962#L361-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 29795#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; 31953#L260-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 31128#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 29928#L268-1 stop_simulation_#t~ret10 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret10;havoc stop_simulation_#t~ret10; 29923#L399 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 29870#L406 stop_simulation_#res := stop_simulation_~__retres2~0; 29808#L407 start_simulation_#t~ret11 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret11;havoc start_simulation_#t~ret11; 29809#L441 assume !(0 != start_simulation_~tmp~3); 29817#L424-1 assume !false; 29988#L425 [2021-08-27 16:30:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1697477152, now seen corresponding path program 4 times [2021-08-27 16:30:07,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789858867] [2021-08-27 16:30:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,932 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,968 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1083306892, now seen corresponding path program 1 times [2021-08-27 16:30:07,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840153014] [2021-08-27 16:30:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,973 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:07,980 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:07,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash 19493203, now seen corresponding path program 1 times [2021-08-27 16:30:07,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:07,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268249072] [2021-08-27 16:30:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:07,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:08,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:08,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268249072] [2021-08-27 16:30:08,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268249072] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:08,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:08,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:30:08,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154641424] [2021-08-27 16:30:08,467 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:30:08,467 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:30:08,467 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:30:08,467 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:30:08,467 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:30:08,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:08,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:30:08,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:30:08,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration25_Loop [2021-08-27 16:30:08,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:30:08,468 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:30:08,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:08,811 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:30:08,811 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:30:08,811 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:08,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:08,812 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:08,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 16:30:08,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:08,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:08,856 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:08,856 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: [] [2021-08-27 16:30:08,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:08,879 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:08,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:08,881 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:08,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:08,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:08,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 16:30:08,932 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:08,932 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~b0_ev~0=-1} Honda state: {~b0_ev~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:30:08,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:08,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:08,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:08,951 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:08,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 16:30:08,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:08,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:08,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:08,986 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: [] [2021-08-27 16:30:09,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,006 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 16:30:09,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:09,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:09,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:09,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_~__retres2~0=0, ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp~3=0} Honda state: {ULTIMATE.start_stop_simulation_~__retres2~0=0, ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:30:09,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,045 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,046 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 16:30:09,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:09,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:09,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:09,056 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: [] [2021-08-27 16:30:09,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-08-27 16:30:09,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,076 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 16:30:09,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:09,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:09,086 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:30:09,086 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: [] [2021-08-27 16:30:09,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,102 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,103 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:30:09,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:09,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 16:30:09,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,132 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,133 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 16:30:09,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:30:09,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:30:09,144 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:30:09,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,161 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:30:09,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:30:09,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:30:09,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:30:09,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:30:09,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:30:09,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:30:09,161 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration25_Loop [2021-08-27 16:30:09,161 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:30:09,161 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:30:09,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:30:09,554 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:30:09,555 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:30:09,555 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,556 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 16:30:09,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:09,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:09,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:09,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:09,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:09,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:09,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:09,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:09,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:09,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,593 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,594 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 16:30:09,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:09,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:09,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:09,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:09,603 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:30:09,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:09,605 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 16:30:09,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:09,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:09,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-08-27 16:30:09,627 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,628 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 16:30:09,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:09,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:09,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:09,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:09,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:09,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:09,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:09,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:09,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:09,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,654 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,654 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-08-27 16:30:09,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:09,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:09,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:09,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:09,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:09,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:09,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:09,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:09,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:09,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,686 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,687 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 16:30:09,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:09,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:09,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:09,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:09,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:09,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:09,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:09,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:09,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:09,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-08-27 16:30:09,712 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,713 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 16:30:09,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:09,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:09,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:09,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:09,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:09,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:09,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:09,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:09,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:30:09,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,741 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,742 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 16:30:09,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 16:30:09,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:30:09,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:30:09,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:30:09,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:30:09,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:30:09,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:30:09,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:30:09,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:30:09,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:30:09,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:30:09,771 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:09,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:09,772 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:30:09,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 16:30:09,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:30:09,781 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:30:09,781 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:30:09,781 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b1_ev~0) = -2*~b1_ev~0 + 3 Supporting invariants [] [2021-08-27 16:30:09,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 16:30:09,797 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:30:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:09,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:30:09,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:30:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:09,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:30:09,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:30:10,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-08-27 16:30:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-27 16:30:10,324 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 [2021-08-27 16:30:10,324 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2295 states and 3187 transitions. cyclomatic complexity: 895 Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:10,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2295 states and 3187 transitions. cyclomatic complexity: 895. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5962 states and 8267 transitions. Complement of second has 7 states. [2021-08-27 16:30:10,368 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 [2021-08-27 16:30:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2021-08-27 16:30:10,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 33 letters. Loop has 56 letters. [2021-08-27 16:30:10,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:30:10,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 89 letters. Loop has 56 letters. [2021-08-27 16:30:10,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:30:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 154 transitions. Stem has 33 letters. Loop has 112 letters. [2021-08-27 16:30:10,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:30:10,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5962 states and 8267 transitions. [2021-08-27 16:30:10,387 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2428 [2021-08-27 16:30:10,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5962 states to 5570 states and 7767 transitions. [2021-08-27 16:30:10,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2505 [2021-08-27 16:30:10,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2520 [2021-08-27 16:30:10,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 7767 transitions. [2021-08-27 16:30:10,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:10,410 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 7767 transitions. [2021-08-27 16:30:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 7767 transitions. [2021-08-27 16:30:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5539. [2021-08-27 16:30:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5539 states, 5539 states have (on average 1.393753385087561) internal successors, (7720), 5538 states have internal predecessors, (7720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5539 states to 5539 states and 7720 transitions. [2021-08-27 16:30:10,474 INFO L704 BuchiCegarLoop]: Abstraction has 5539 states and 7720 transitions. [2021-08-27 16:30:10,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:30:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:30:10,475 INFO L87 Difference]: Start difference. First operand 5539 states and 7720 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:10,513 INFO L93 Difference]: Finished difference Result 8355 states and 11527 transitions. [2021-08-27 16:30:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:30:10,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8355 states and 11527 transitions. [2021-08-27 16:30:10,539 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4288 [2021-08-27 16:30:10,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8355 states to 8355 states and 11527 transitions. [2021-08-27 16:30:10,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4365 [2021-08-27 16:30:10,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4365 [2021-08-27 16:30:10,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8355 states and 11527 transitions. [2021-08-27 16:30:10,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:30:10,577 INFO L681 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2021-08-27 16:30:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states and 11527 transitions. [2021-08-27 16:30:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 8355. [2021-08-27 16:30:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8355 states, 8355 states have (on average 1.3796529024536206) internal successors, (11527), 8354 states have internal predecessors, (11527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 11527 transitions. [2021-08-27 16:30:10,740 INFO L704 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2021-08-27 16:30:10,741 INFO L587 BuchiCegarLoop]: Abstraction has 8355 states and 11527 transitions. [2021-08-27 16:30:10,741 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-08-27 16:30:10,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8355 states and 11527 transitions. [2021-08-27 16:30:10,757 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4288 [2021-08-27 16:30:10,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:10,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:10,758 INFO L842 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] [2021-08-27 16:30:10,758 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:10,758 INFO L791 eck$LassoCheckResult]: Stem: 52470#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; 52314#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; 52315#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; 52349#L204 assume 1 == ~b0_req_up~0; 52444#L129 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 52252#L129-2 ~b0_req_up~0 := 0; 52253#L204-1 assume 1 == ~b1_req_up~0; 52250#L144 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 52251#L144-2 ~b1_req_up~0 := 0; 52379#L211 assume 1 == ~d0_req_up~0; 52386#L159 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 52387#L159-2 ~d0_req_up~0 := 0; 52316#L218 assume 1 == ~d1_req_up~0; 52317#L174 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 52453#L174-2 ~d1_req_up~0 := 0; 52304#L225 assume !(1 == ~z_req_up~0); 52305#L232 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 52461#L247-1 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 52462#L313-1 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 52354#L318-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 52355#L323-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 52394#L328-1 assume !(0 == ~z_ev~0); 52395#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; 52445#L99 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0 := 1; 52446#L121 is_method1_triggered_#res := is_method1_triggered_~__retres1~0; 52337#L122 activate_threads_#t~ret9 := is_method1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 52338#L382 assume 0 != activate_threads_~tmp~1;~comp_m1_st~0 := 0; 52258#L382-2 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 52259#L346-1 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 52280#L351-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 52281#L356-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 52260#L361-1 assume !(1 == ~z_ev~0); 52261#L424-1 assume !false; 53924#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; 53945#L287 [2021-08-27 16:30:10,758 INFO L793 eck$LassoCheckResult]: Loop: 53945#L287 assume !false; 59675#L278 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~1;havoc exists_runnable_thread_~__retres1~1; 59674#L260 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1 := 1; 59010#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~1; 59643#L268 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp___0~0 := eval_#t~ret7;havoc eval_#t~ret7; 59639#L282 assume 0 != eval_~tmp___0~0; 52368#L282-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 52369#L291 assume !(0 != eval_~tmp~0); 53945#L287 [2021-08-27 16:30:10,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:10,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1082183973, now seen corresponding path program 1 times [2021-08-27 16:30:10,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:10,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102223922] [2021-08-27 16:30:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:10,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:10,767 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:10,773 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1768213899, now seen corresponding path program 1 times [2021-08-27 16:30:10,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:10,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953356190] [2021-08-27 16:30:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:10,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:10,776 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:10,779 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:10,780 INFO L82 PathProgramCache]: Analyzing trace with hash -937655707, now seen corresponding path program 1 times [2021-08-27 16:30:10,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:10,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854929791] [2021-08-27 16:30:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:10,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:10,790 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:10,800 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:12,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:30:12 BoogieIcfgContainer [2021-08-27 16:30:12,086 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:30:12,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:30:12,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:30:12,086 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:30:12,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:03" (3/4) ... [2021-08-27 16:30:12,088 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 16:30:12,120 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 16:30:12,122 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:30:12,123 INFO L168 Benchmark]: Toolchain (without parser) took 9849.56 ms. Allocated memory was 54.5 MB in the beginning and 444.6 MB in the end (delta: 390.1 MB). Free memory was 31.6 MB in the beginning and 331.3 MB in the end (delta: -299.7 MB). Peak memory consumption was 89.8 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:12,123 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:30:12,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.52 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 31.4 MB in the beginning and 53.3 MB in the end (delta: -21.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:12,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.05 ms. Allocated memory is still 71.3 MB. Free memory was 53.3 MB in the beginning and 50.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:12,124 INFO L168 Benchmark]: Boogie Preprocessor took 41.33 ms. Allocated memory is still 71.3 MB. Free memory was 50.9 MB in the beginning and 49.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:12,124 INFO L168 Benchmark]: RCFGBuilder took 480.59 ms. Allocated memory is still 71.3 MB. Free memory was 48.8 MB in the beginning and 41.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:12,125 INFO L168 Benchmark]: BuchiAutomizer took 9027.41 ms. Allocated memory was 71.3 MB in the beginning and 444.6 MB in the end (delta: 373.3 MB). Free memory was 41.3 MB in the beginning and 334.5 MB in the end (delta: -293.2 MB). Peak memory consumption was 199.3 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:12,125 INFO L168 Benchmark]: Witness Printer took 35.32 ms. Allocated memory is still 444.6 MB. Free memory was 334.5 MB in the beginning and 331.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:12,126 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.11 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 212.52 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 31.4 MB in the beginning and 53.3 MB in the end (delta: -21.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.05 ms. Allocated memory is still 71.3 MB. Free memory was 53.3 MB in the beginning and 50.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.33 ms. Allocated memory is still 71.3 MB. Free memory was 50.9 MB in the beginning and 49.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 480.59 ms. Allocated memory is still 71.3 MB. Free memory was 48.8 MB in the beginning and 41.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 9027.41 ms. Allocated memory was 71.3 MB in the beginning and 444.6 MB in the end (delta: 373.3 MB). Free memory was 41.3 MB in the beginning and 334.5 MB in the end (delta: -293.2 MB). Peak memory consumption was 199.3 MB. Max. memory is 16.1 GB. * Witness Printer took 35.32 ms. Allocated memory is still 444.6 MB. Free memory was 334.5 MB in the beginning and 331.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 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 -1 * b0_ev + 1 and consists of 3 locations. One deterministic module has affine ranking function 3 + -2 * b1_ev 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 8.9s and 26 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 19. Minimization of nondet autom 8. Automata minimization 459.6ms AutomataMinimizationTime, 27 MinimizatonAttempts, 4574 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s 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: 4477 SDtfs, 1815 SDslu, 5084 SDs, 0 SdLazy, 379 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 325.5ms Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT2 SILN0 SILU0 SILI19 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital107 mio100 ax100 hnf100 lsp10 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq204 hnf89 smp100 dnf181 smp78 tf106 neg93 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - 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=19734} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7acb9864=0, b1_val_t=1, NULL=19737, NULL=0, \result=0, d0_val=1, NULL=19734, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4695bf25=0, z_val=0, tmp=0, b0_val_t=1, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6489eb42=0, d1_ev=2, comp_m1_i=0, b1_val=1, d1_req_up=0, tmp___0=1, NULL=19735, 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=19736, comp_m1_st=0, b0_req_up=0, z_req_up=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28784813=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! [2021-08-27 16:30:12,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...