./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:50:11,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:50:11,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:50:11,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:50:11,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:50:11,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:50:11,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:50:11,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:50:11,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:50:11,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:50:11,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:50:11,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:50:11,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:50:11,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:50:11,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:50:11,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:50:11,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:50:11,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:50:11,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:50:11,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:50:11,320 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:50:11,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:50:11,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:50:11,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:50:11,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:50:11,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:50:11,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:50:11,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:50:11,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:50:11,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:50:11,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:50:11,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:50:11,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:50:11,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:50:11,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:50:11,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:50:11,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:50:11,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:50:11,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:50:11,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:50:11,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:50:11,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:50:11,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:50:11,357 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:50:11,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:50:11,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:50:11,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:50:11,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:50:11,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:50:11,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:50:11,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:50:11,359 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:50:11,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:50:11,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:50:11,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:50:11,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:50:11,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:50:11,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:50:11,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:50:11,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:50:11,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:50:11,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:50:11,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:50:11,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:50:11,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:50:11,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:50:11,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:50:11,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:50:11,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:50:11,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:50:11,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:50:11,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:50:11,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:50:11,364 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:50:11,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:50:11,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:50:11,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2022-07-13 21:50:11,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:50:11,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:50:11,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:50:11,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:50:11,560 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:50:11,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-07-13 21:50:11,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1ff779/53c3a09ea10148f49bfa19e4dc852a79/FLAGcbad86fdc [2022-07-13 21:50:12,020 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:50:12,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-07-13 21:50:12,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1ff779/53c3a09ea10148f49bfa19e4dc852a79/FLAGcbad86fdc [2022-07-13 21:50:12,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1ff779/53c3a09ea10148f49bfa19e4dc852a79 [2022-07-13 21:50:12,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:50:12,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:50:12,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:50:12,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:50:12,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:50:12,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1734e964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12, skipping insertion in model container [2022-07-13 21:50:12,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:50:12,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:50:12,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-07-13 21:50:12,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:50:12,429 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:50:12,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-07-13 21:50:12,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:50:12,527 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:50:12,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12 WrapperNode [2022-07-13 21:50:12,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:50:12,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:50:12,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:50:12,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:50:12,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,586 INFO L137 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 226 [2022-07-13 21:50:12,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:50:12,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:50:12,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:50:12,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:50:12,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:50:12,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:50:12,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:50:12,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:50:12,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (1/1) ... [2022-07-13 21:50:12,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:50:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:50:12,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:50:12,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:50:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 21:50:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:50:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:50:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:50:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:50:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:50:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-13 21:50:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-13 21:50:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-13 21:50:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-13 21:50:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-13 21:50:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-13 21:50:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-13 21:50:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-13 21:50:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:50:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:50:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:50:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:50:12,701 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:50:12,846 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:50:12,847 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:50:13,319 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:50:13,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:50:13,711 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:50:13,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:50:13 BoogieIcfgContainer [2022-07-13 21:50:13,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:50:13,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:50:13,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:50:13,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:50:13,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:50:12" (1/3) ... [2022-07-13 21:50:13,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a97b62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:50:13, skipping insertion in model container [2022-07-13 21:50:13,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:50:12" (2/3) ... [2022-07-13 21:50:13,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a97b62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:50:13, skipping insertion in model container [2022-07-13 21:50:13,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:50:13" (3/3) ... [2022-07-13 21:50:13,719 INFO L111 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2022-07-13 21:50:13,723 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:50:13,729 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:50:13,729 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:50:13,729 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:50:13,800 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 21:50:13,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 164 places, 153 transitions, 326 flow [2022-07-13 21:50:13,889 INFO L129 PetriNetUnfolder]: 2/149 cut-off events. [2022-07-13 21:50:13,889 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:50:13,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-07-13 21:50:13,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 153 transitions, 326 flow [2022-07-13 21:50:13,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 149 transitions, 310 flow [2022-07-13 21:50:13,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:50:13,918 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6903baea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74a0a636 [2022-07-13 21:50:13,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-13 21:50:13,935 INFO L129 PetriNetUnfolder]: 0/82 cut-off events. [2022-07-13 21:50:13,935 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:50:13,935 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:13,936 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:13,937 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1502101798, now seen corresponding path program 1 times [2022-07-13 21:50:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:13,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898444996] [2022-07-13 21:50:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:14,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:14,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898444996] [2022-07-13 21:50:14,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898444996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:14,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:14,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:50:14,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895409014] [2022-07-13 21:50:14,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:14,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:50:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:14,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:50:14,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:50:14,245 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 153 [2022-07-13 21:50:14,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 149 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 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) [2022-07-13 21:50:14,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:14,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 153 [2022-07-13 21:50:14,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:14,558 INFO L129 PetriNetUnfolder]: 258/937 cut-off events. [2022-07-13 21:50:14,559 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-07-13 21:50:14,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 937 events. 258/937 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5511 event pairs, 58 based on Foata normal form. 36/917 useless extension candidates. Maximal degree in co-relation 1313. Up to 289 conditions per place. [2022-07-13 21:50:14,570 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 19 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2022-07-13 21:50:14,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 153 transitions, 366 flow [2022-07-13 21:50:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:50:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:50:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-07-13 21:50:14,587 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9455337690631809 [2022-07-13 21:50:14,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-07-13 21:50:14,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-07-13 21:50:14,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:14,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-07-13 21:50:14,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2022-07-13 21:50:14,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 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) [2022-07-13 21:50:14,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 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) [2022-07-13 21:50:14,606 INFO L186 Difference]: Start difference. First operand has 160 places, 149 transitions, 310 flow. Second operand 3 states and 434 transitions. [2022-07-13 21:50:14,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 153 transitions, 366 flow [2022-07-13 21:50:14,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 153 transitions, 360 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 21:50:14,613 INFO L242 Difference]: Finished difference. Result has 156 places, 145 transitions, 302 flow [2022-07-13 21:50:14,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=156, PETRI_TRANSITIONS=145} [2022-07-13 21:50:14,617 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -4 predicate places. [2022-07-13 21:50:14,618 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 145 transitions, 302 flow [2022-07-13 21:50:14,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 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) [2022-07-13 21:50:14,618 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:14,619 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:50:14,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 543536506, now seen corresponding path program 1 times [2022-07-13 21:50:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:14,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886274063] [2022-07-13 21:50:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:14,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886274063] [2022-07-13 21:50:14,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886274063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:14,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:14,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:50:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929616420] [2022-07-13 21:50:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:14,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:50:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:14,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:50:14,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:50:14,886 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 153 [2022-07-13 21:50:14,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 145 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 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) [2022-07-13 21:50:14,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:14,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 153 [2022-07-13 21:50:14,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:15,668 INFO L129 PetriNetUnfolder]: 1428/3793 cut-off events. [2022-07-13 21:50:15,668 INFO L130 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-07-13 21:50:15,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 3793 events. 1428/3793 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 30593 event pairs, 741 based on Foata normal form. 0/3670 useless extension candidates. Maximal degree in co-relation 6074. Up to 1041 conditions per place. [2022-07-13 21:50:15,687 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 26 selfloop transitions, 2 changer transitions 59/199 dead transitions. [2022-07-13 21:50:15,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 199 transitions, 578 flow [2022-07-13 21:50:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:50:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:50:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1237 transitions. [2022-07-13 21:50:15,690 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8983297022512708 [2022-07-13 21:50:15,690 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1237 transitions. [2022-07-13 21:50:15,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1237 transitions. [2022-07-13 21:50:15,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:15,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1237 transitions. [2022-07-13 21:50:15,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.44444444444446) internal successors, (1237), 9 states have internal predecessors, (1237), 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) [2022-07-13 21:50:15,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 153.0) internal successors, (1530), 10 states have internal predecessors, (1530), 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) [2022-07-13 21:50:15,697 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 153.0) internal successors, (1530), 10 states have internal predecessors, (1530), 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) [2022-07-13 21:50:15,697 INFO L186 Difference]: Start difference. First operand has 156 places, 145 transitions, 302 flow. Second operand 9 states and 1237 transitions. [2022-07-13 21:50:15,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 199 transitions, 578 flow [2022-07-13 21:50:15,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 199 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:50:15,704 INFO L242 Difference]: Finished difference. Result has 169 places, 131 transitions, 290 flow [2022-07-13 21:50:15,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=290, PETRI_PLACES=169, PETRI_TRANSITIONS=131} [2022-07-13 21:50:15,705 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 9 predicate places. [2022-07-13 21:50:15,705 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 131 transitions, 290 flow [2022-07-13 21:50:15,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 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) [2022-07-13 21:50:15,706 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:15,706 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:15,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:50:15,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1200686363, now seen corresponding path program 1 times [2022-07-13 21:50:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:15,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746313460] [2022-07-13 21:50:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:15,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746313460] [2022-07-13 21:50:15,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746313460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:15,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:15,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:50:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596939693] [2022-07-13 21:50:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:15,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:50:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:50:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:50:15,857 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 153 [2022-07-13 21:50:15,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 131 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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) [2022-07-13 21:50:15,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:15,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 153 [2022-07-13 21:50:15,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:16,705 INFO L129 PetriNetUnfolder]: 2084/3745 cut-off events. [2022-07-13 21:50:16,706 INFO L130 PetriNetUnfolder]: For 762/762 co-relation queries the response was YES. [2022-07-13 21:50:16,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7701 conditions, 3745 events. 2084/3745 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23229 event pairs, 384 based on Foata normal form. 72/3673 useless extension candidates. Maximal degree in co-relation 7617. Up to 1149 conditions per place. [2022-07-13 21:50:16,725 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 31 selfloop transitions, 4 changer transitions 53/197 dead transitions. [2022-07-13 21:50:16,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 197 transitions, 621 flow [2022-07-13 21:50:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:50:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:50:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1350 transitions. [2022-07-13 21:50:16,728 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2022-07-13 21:50:16,729 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1350 transitions. [2022-07-13 21:50:16,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1350 transitions. [2022-07-13 21:50:16,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:16,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1350 transitions. [2022-07-13 21:50:16,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-07-13 21:50:16,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:16,735 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:16,735 INFO L186 Difference]: Start difference. First operand has 169 places, 131 transitions, 290 flow. Second operand 10 states and 1350 transitions. [2022-07-13 21:50:16,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 197 transitions, 621 flow [2022-07-13 21:50:16,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 197 transitions, 587 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-13 21:50:16,755 INFO L242 Difference]: Finished difference. Result has 158 places, 131 transitions, 304 flow [2022-07-13 21:50:16,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=158, PETRI_TRANSITIONS=131} [2022-07-13 21:50:16,756 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -2 predicate places. [2022-07-13 21:50:16,756 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 304 flow [2022-07-13 21:50:16,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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) [2022-07-13 21:50:16,757 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:16,757 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:16,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:50:16,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1066210362, now seen corresponding path program 1 times [2022-07-13 21:50:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:16,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701173873] [2022-07-13 21:50:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:16,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:16,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701173873] [2022-07-13 21:50:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701173873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:16,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:16,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:50:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687481751] [2022-07-13 21:50:16,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:16,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:50:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:16,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:50:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:50:16,883 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 153 [2022-07-13 21:50:16,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 304 flow. Second operand has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 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) [2022-07-13 21:50:16,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:16,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 153 [2022-07-13 21:50:16,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:17,336 INFO L129 PetriNetUnfolder]: 719/1513 cut-off events. [2022-07-13 21:50:17,336 INFO L130 PetriNetUnfolder]: For 517/526 co-relation queries the response was YES. [2022-07-13 21:50:17,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 1513 events. 719/1513 cut-off events. For 517/526 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8366 event pairs, 267 based on Foata normal form. 36/1492 useless extension candidates. Maximal degree in co-relation 2955. Up to 549 conditions per place. [2022-07-13 21:50:17,348 INFO L132 encePairwiseOnDemand]: 146/153 looper letters, 22 selfloop transitions, 3 changer transitions 37/174 dead transitions. [2022-07-13 21:50:17,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 538 flow [2022-07-13 21:50:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:50:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:50:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1354 transitions. [2022-07-13 21:50:17,351 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8849673202614379 [2022-07-13 21:50:17,351 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1354 transitions. [2022-07-13 21:50:17,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1354 transitions. [2022-07-13 21:50:17,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:17,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1354 transitions. [2022-07-13 21:50:17,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.4) internal successors, (1354), 10 states have internal predecessors, (1354), 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) [2022-07-13 21:50:17,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:17,357 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:17,357 INFO L186 Difference]: Start difference. First operand has 158 places, 131 transitions, 304 flow. Second operand 10 states and 1354 transitions. [2022-07-13 21:50:17,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 174 transitions, 538 flow [2022-07-13 21:50:17,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 174 transitions, 492 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-07-13 21:50:17,393 INFO L242 Difference]: Finished difference. Result has 158 places, 131 transitions, 300 flow [2022-07-13 21:50:17,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=300, PETRI_PLACES=158, PETRI_TRANSITIONS=131} [2022-07-13 21:50:17,395 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -2 predicate places. [2022-07-13 21:50:17,396 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 300 flow [2022-07-13 21:50:17,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 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) [2022-07-13 21:50:17,396 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:17,397 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:50:17,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1584643257, now seen corresponding path program 1 times [2022-07-13 21:50:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:17,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914213699] [2022-07-13 21:50:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:17,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914213699] [2022-07-13 21:50:17,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914213699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:17,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:17,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:50:17,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992073007] [2022-07-13 21:50:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:17,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:50:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:50:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:50:17,559 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153 [2022-07-13 21:50:17,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 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) [2022-07-13 21:50:17,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:17,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153 [2022-07-13 21:50:17,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:18,581 INFO L129 PetriNetUnfolder]: 4273/7418 cut-off events. [2022-07-13 21:50:18,582 INFO L130 PetriNetUnfolder]: For 725/725 co-relation queries the response was YES. [2022-07-13 21:50:18,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14934 conditions, 7418 events. 4273/7418 cut-off events. For 725/725 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 51876 event pairs, 214 based on Foata normal form. 0/7269 useless extension candidates. Maximal degree in co-relation 14848. Up to 2518 conditions per place. [2022-07-13 21:50:18,624 INFO L132 encePairwiseOnDemand]: 142/153 looper letters, 38 selfloop transitions, 7 changer transitions 60/212 dead transitions. [2022-07-13 21:50:18,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 212 transitions, 697 flow [2022-07-13 21:50:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:50:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:50:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1357 transitions. [2022-07-13 21:50:18,628 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8869281045751634 [2022-07-13 21:50:18,628 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1357 transitions. [2022-07-13 21:50:18,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1357 transitions. [2022-07-13 21:50:18,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:18,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1357 transitions. [2022-07-13 21:50:18,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.7) internal successors, (1357), 10 states have internal predecessors, (1357), 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) [2022-07-13 21:50:18,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:18,637 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:18,637 INFO L186 Difference]: Start difference. First operand has 158 places, 131 transitions, 300 flow. Second operand 10 states and 1357 transitions. [2022-07-13 21:50:18,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 212 transitions, 697 flow [2022-07-13 21:50:18,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 212 transitions, 665 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-07-13 21:50:18,649 INFO L242 Difference]: Finished difference. Result has 158 places, 134 transitions, 348 flow [2022-07-13 21:50:18,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=348, PETRI_PLACES=158, PETRI_TRANSITIONS=134} [2022-07-13 21:50:18,649 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -2 predicate places. [2022-07-13 21:50:18,650 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 134 transitions, 348 flow [2022-07-13 21:50:18,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 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) [2022-07-13 21:50:18,650 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:18,650 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:18,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:50:18,651 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2052933340, now seen corresponding path program 1 times [2022-07-13 21:50:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:18,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830182728] [2022-07-13 21:50:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:18,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830182728] [2022-07-13 21:50:18,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830182728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:18,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:18,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:50:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424754134] [2022-07-13 21:50:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:18,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:50:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:50:18,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:50:18,821 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153 [2022-07-13 21:50:18,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 134 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 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) [2022-07-13 21:50:18,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:18,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153 [2022-07-13 21:50:18,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:19,550 INFO L129 PetriNetUnfolder]: 1873/3624 cut-off events. [2022-07-13 21:50:19,550 INFO L130 PetriNetUnfolder]: For 4067/4161 co-relation queries the response was YES. [2022-07-13 21:50:19,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10149 conditions, 3624 events. 1873/3624 cut-off events. For 4067/4161 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24231 event pairs, 65 based on Foata normal form. 108/3706 useless extension candidates. Maximal degree in co-relation 10063. Up to 1001 conditions per place. [2022-07-13 21:50:19,577 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 45 selfloop transitions, 11 changer transitions 47/210 dead transitions. [2022-07-13 21:50:19,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 210 transitions, 882 flow [2022-07-13 21:50:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:50:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:50:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1355 transitions. [2022-07-13 21:50:19,582 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8856209150326797 [2022-07-13 21:50:19,582 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1355 transitions. [2022-07-13 21:50:19,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1355 transitions. [2022-07-13 21:50:19,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:19,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1355 transitions. [2022-07-13 21:50:19,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.5) internal successors, (1355), 10 states have internal predecessors, (1355), 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) [2022-07-13 21:50:19,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:19,588 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 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) [2022-07-13 21:50:19,588 INFO L186 Difference]: Start difference. First operand has 158 places, 134 transitions, 348 flow. Second operand 10 states and 1355 transitions. [2022-07-13 21:50:19,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 210 transitions, 882 flow [2022-07-13 21:50:19,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 210 transitions, 857 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-13 21:50:19,599 INFO L242 Difference]: Finished difference. Result has 162 places, 138 transitions, 436 flow [2022-07-13 21:50:19,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=436, PETRI_PLACES=162, PETRI_TRANSITIONS=138} [2022-07-13 21:50:19,600 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2022-07-13 21:50:19,600 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 138 transitions, 436 flow [2022-07-13 21:50:19,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 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) [2022-07-13 21:50:19,601 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:19,601 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:19,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:50:19,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:19,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash -649547673, now seen corresponding path program 1 times [2022-07-13 21:50:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:19,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068347429] [2022-07-13 21:50:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:19,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:19,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068347429] [2022-07-13 21:50:19,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068347429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:19,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:19,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 21:50:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758142637] [2022-07-13 21:50:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:19,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 21:50:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 21:50:19,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:50:19,993 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 153 [2022-07-13 21:50:19,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 138 transitions, 436 flow. Second operand has 16 states, 16 states have (on average 114.0625) internal successors, (1825), 16 states have internal predecessors, (1825), 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) [2022-07-13 21:50:19,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:19,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 153 [2022-07-13 21:50:19,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:20,831 INFO L129 PetriNetUnfolder]: 584/1793 cut-off events. [2022-07-13 21:50:20,831 INFO L130 PetriNetUnfolder]: For 2678/2822 co-relation queries the response was YES. [2022-07-13 21:50:20,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 1793 events. 584/1793 cut-off events. For 2678/2822 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 12568 event pairs, 252 based on Foata normal form. 40/1787 useless extension candidates. Maximal degree in co-relation 4538. Up to 501 conditions per place. [2022-07-13 21:50:20,845 INFO L132 encePairwiseOnDemand]: 135/153 looper letters, 70 selfloop transitions, 36 changer transitions 0/208 dead transitions. [2022-07-13 21:50:20,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 208 transitions, 810 flow [2022-07-13 21:50:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 21:50:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-13 21:50:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2461 transitions. [2022-07-13 21:50:20,851 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7659508247743542 [2022-07-13 21:50:20,851 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2461 transitions. [2022-07-13 21:50:20,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2461 transitions. [2022-07-13 21:50:20,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:20,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2461 transitions. [2022-07-13 21:50:20,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 117.19047619047619) internal successors, (2461), 21 states have internal predecessors, (2461), 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) [2022-07-13 21:50:20,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 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) [2022-07-13 21:50:20,883 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 153.0) internal successors, (3366), 22 states have internal predecessors, (3366), 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) [2022-07-13 21:50:20,883 INFO L186 Difference]: Start difference. First operand has 162 places, 138 transitions, 436 flow. Second operand 21 states and 2461 transitions. [2022-07-13 21:50:20,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 208 transitions, 810 flow [2022-07-13 21:50:20,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 208 transitions, 741 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-07-13 21:50:20,891 INFO L242 Difference]: Finished difference. Result has 182 places, 166 transitions, 609 flow [2022-07-13 21:50:20,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=609, PETRI_PLACES=182, PETRI_TRANSITIONS=166} [2022-07-13 21:50:20,891 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 22 predicate places. [2022-07-13 21:50:20,892 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 166 transitions, 609 flow [2022-07-13 21:50:20,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 114.0625) internal successors, (1825), 16 states have internal predecessors, (1825), 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) [2022-07-13 21:50:20,892 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:20,893 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:20,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:50:20,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:20,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1678358243, now seen corresponding path program 2 times [2022-07-13 21:50:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:20,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17183905] [2022-07-13 21:50:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:21,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:21,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17183905] [2022-07-13 21:50:21,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17183905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:21,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:21,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 21:50:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901452810] [2022-07-13 21:50:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:21,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 21:50:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 21:50:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:50:21,208 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 153 [2022-07-13 21:50:21,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 166 transitions, 609 flow. Second operand has 16 states, 16 states have (on average 114.0625) internal successors, (1825), 16 states have internal predecessors, (1825), 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) [2022-07-13 21:50:21,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:21,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 153 [2022-07-13 21:50:21,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:22,006 INFO L129 PetriNetUnfolder]: 670/1980 cut-off events. [2022-07-13 21:50:22,007 INFO L130 PetriNetUnfolder]: For 4379/4501 co-relation queries the response was YES. [2022-07-13 21:50:22,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6539 conditions, 1980 events. 670/1980 cut-off events. For 4379/4501 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 14286 event pairs, 174 based on Foata normal form. 41/1968 useless extension candidates. Maximal degree in co-relation 6421. Up to 705 conditions per place. [2022-07-13 21:50:22,022 INFO L132 encePairwiseOnDemand]: 136/153 looper letters, 84 selfloop transitions, 39 changer transitions 35/260 dead transitions. [2022-07-13 21:50:22,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 260 transitions, 1573 flow [2022-07-13 21:50:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 21:50:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-07-13 21:50:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2920 transitions. [2022-07-13 21:50:22,027 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7633986928104575 [2022-07-13 21:50:22,028 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2920 transitions. [2022-07-13 21:50:22,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2920 transitions. [2022-07-13 21:50:22,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:22,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2920 transitions. [2022-07-13 21:50:22,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 116.8) internal successors, (2920), 25 states have internal predecessors, (2920), 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) [2022-07-13 21:50:22,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 153.0) internal successors, (3978), 26 states have internal predecessors, (3978), 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) [2022-07-13 21:50:22,039 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 153.0) internal successors, (3978), 26 states have internal predecessors, (3978), 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) [2022-07-13 21:50:22,039 INFO L186 Difference]: Start difference. First operand has 182 places, 166 transitions, 609 flow. Second operand 25 states and 2920 transitions. [2022-07-13 21:50:22,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 260 transitions, 1573 flow [2022-07-13 21:50:22,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 260 transitions, 1527 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-07-13 21:50:22,049 INFO L242 Difference]: Finished difference. Result has 216 places, 188 transitions, 901 flow [2022-07-13 21:50:22,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=901, PETRI_PLACES=216, PETRI_TRANSITIONS=188} [2022-07-13 21:50:22,050 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 56 predicate places. [2022-07-13 21:50:22,050 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 188 transitions, 901 flow [2022-07-13 21:50:22,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 114.0625) internal successors, (1825), 16 states have internal predecessors, (1825), 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) [2022-07-13 21:50:22,051 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:22,051 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:50:22,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2144429725, now seen corresponding path program 3 times [2022-07-13 21:50:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402332897] [2022-07-13 21:50:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:22,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:22,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402332897] [2022-07-13 21:50:22,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402332897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:22,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:22,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-07-13 21:50:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714183383] [2022-07-13 21:50:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:22,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 21:50:22,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 21:50:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-07-13 21:50:22,737 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 153 [2022-07-13 21:50:22,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 188 transitions, 901 flow. Second operand has 23 states, 23 states have (on average 97.78260869565217) internal successors, (2249), 23 states have internal predecessors, (2249), 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) [2022-07-13 21:50:22,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:22,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 153 [2022-07-13 21:50:22,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:24,030 INFO L129 PetriNetUnfolder]: 902/2708 cut-off events. [2022-07-13 21:50:24,031 INFO L130 PetriNetUnfolder]: For 12331/12510 co-relation queries the response was YES. [2022-07-13 21:50:24,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10523 conditions, 2708 events. 902/2708 cut-off events. For 12331/12510 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 21128 event pairs, 333 based on Foata normal form. 50/2686 useless extension candidates. Maximal degree in co-relation 10382. Up to 983 conditions per place. [2022-07-13 21:50:24,055 INFO L132 encePairwiseOnDemand]: 130/153 looper letters, 117 selfloop transitions, 72 changer transitions 18/301 dead transitions. [2022-07-13 21:50:24,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 301 transitions, 2427 flow [2022-07-13 21:50:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 21:50:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-07-13 21:50:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3219 transitions. [2022-07-13 21:50:24,060 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6574754901960784 [2022-07-13 21:50:24,061 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3219 transitions. [2022-07-13 21:50:24,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3219 transitions. [2022-07-13 21:50:24,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:24,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3219 transitions. [2022-07-13 21:50:24,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 100.59375) internal successors, (3219), 32 states have internal predecessors, (3219), 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) [2022-07-13 21:50:24,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 153.0) internal successors, (5049), 33 states have internal predecessors, (5049), 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) [2022-07-13 21:50:24,072 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 153.0) internal successors, (5049), 33 states have internal predecessors, (5049), 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) [2022-07-13 21:50:24,072 INFO L186 Difference]: Start difference. First operand has 216 places, 188 transitions, 901 flow. Second operand 32 states and 3219 transitions. [2022-07-13 21:50:24,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 301 transitions, 2427 flow [2022-07-13 21:50:24,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 301 transitions, 2270 flow, removed 73 selfloop flow, removed 18 redundant places. [2022-07-13 21:50:24,097 INFO L242 Difference]: Finished difference. Result has 230 places, 247 transitions, 1646 flow [2022-07-13 21:50:24,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1646, PETRI_PLACES=230, PETRI_TRANSITIONS=247} [2022-07-13 21:50:24,098 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 70 predicate places. [2022-07-13 21:50:24,098 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 247 transitions, 1646 flow [2022-07-13 21:50:24,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 97.78260869565217) internal successors, (2249), 23 states have internal predecessors, (2249), 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) [2022-07-13 21:50:24,099 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:24,100 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:24,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:50:24,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 138993847, now seen corresponding path program 4 times [2022-07-13 21:50:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:24,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423958777] [2022-07-13 21:50:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:24,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423958777] [2022-07-13 21:50:24,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423958777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:24,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:24,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-07-13 21:50:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157463305] [2022-07-13 21:50:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:24,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 21:50:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 21:50:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-07-13 21:50:24,884 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-07-13 21:50:24,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 247 transitions, 1646 flow. Second operand has 24 states, 24 states have (on average 95.79166666666667) internal successors, (2299), 24 states have internal predecessors, (2299), 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) [2022-07-13 21:50:24,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:24,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-07-13 21:50:24,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:26,327 INFO L129 PetriNetUnfolder]: 970/2939 cut-off events. [2022-07-13 21:50:26,327 INFO L130 PetriNetUnfolder]: For 14176/14342 co-relation queries the response was YES. [2022-07-13 21:50:26,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12119 conditions, 2939 events. 970/2939 cut-off events. For 14176/14342 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 23643 event pairs, 388 based on Foata normal form. 52/2914 useless extension candidates. Maximal degree in co-relation 11970. Up to 1278 conditions per place. [2022-07-13 21:50:26,353 INFO L132 encePairwiseOnDemand]: 128/153 looper letters, 136 selfloop transitions, 56 changer transitions 48/332 dead transitions. [2022-07-13 21:50:26,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 332 transitions, 3094 flow [2022-07-13 21:50:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 21:50:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-13 21:50:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2939 transitions. [2022-07-13 21:50:26,357 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6403050108932462 [2022-07-13 21:50:26,357 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2939 transitions. [2022-07-13 21:50:26,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2939 transitions. [2022-07-13 21:50:26,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:26,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2939 transitions. [2022-07-13 21:50:26,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 97.96666666666667) internal successors, (2939), 30 states have internal predecessors, (2939), 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) [2022-07-13 21:50:26,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 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) [2022-07-13 21:50:26,365 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 153.0) internal successors, (4743), 31 states have internal predecessors, (4743), 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) [2022-07-13 21:50:26,365 INFO L186 Difference]: Start difference. First operand has 230 places, 247 transitions, 1646 flow. Second operand 30 states and 2939 transitions. [2022-07-13 21:50:26,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 332 transitions, 3094 flow [2022-07-13 21:50:26,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 332 transitions, 2880 flow, removed 97 selfloop flow, removed 10 redundant places. [2022-07-13 21:50:26,401 INFO L242 Difference]: Finished difference. Result has 261 places, 277 transitions, 2057 flow [2022-07-13 21:50:26,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2057, PETRI_PLACES=261, PETRI_TRANSITIONS=277} [2022-07-13 21:50:26,402 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 101 predicate places. [2022-07-13 21:50:26,402 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 277 transitions, 2057 flow [2022-07-13 21:50:26,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 95.79166666666667) internal successors, (2299), 24 states have internal predecessors, (2299), 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) [2022-07-13 21:50:26,403 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:26,403 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:26,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:50:26,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash -352138047, now seen corresponding path program 5 times [2022-07-13 21:50:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:26,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692002132] [2022-07-13 21:50:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:27,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:27,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692002132] [2022-07-13 21:50:27,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692002132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:27,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:27,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-07-13 21:50:27,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938086302] [2022-07-13 21:50:27,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:27,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 21:50:27,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:27,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 21:50:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-07-13 21:50:27,043 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153 [2022-07-13 21:50:27,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 277 transitions, 2057 flow. Second operand has 23 states, 23 states have (on average 96.82608695652173) internal successors, (2227), 23 states have internal predecessors, (2227), 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) [2022-07-13 21:50:27,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:27,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153 [2022-07-13 21:50:27,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:28,311 INFO L129 PetriNetUnfolder]: 948/2875 cut-off events. [2022-07-13 21:50:28,312 INFO L130 PetriNetUnfolder]: For 20468/20666 co-relation queries the response was YES. [2022-07-13 21:50:28,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12933 conditions, 2875 events. 948/2875 cut-off events. For 20468/20666 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 23036 event pairs, 380 based on Foata normal form. 61/2858 useless extension candidates. Maximal degree in co-relation 12771. Up to 1259 conditions per place. [2022-07-13 21:50:28,344 INFO L132 encePairwiseOnDemand]: 130/153 looper letters, 149 selfloop transitions, 67 changer transitions 45/354 dead transitions. [2022-07-13 21:50:28,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 354 transitions, 3622 flow [2022-07-13 21:50:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 21:50:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-13 21:50:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2574 transitions. [2022-07-13 21:50:28,348 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-07-13 21:50:28,348 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2574 transitions. [2022-07-13 21:50:28,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2574 transitions. [2022-07-13 21:50:28,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:28,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2574 transitions. [2022-07-13 21:50:28,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 99.0) internal successors, (2574), 26 states have internal predecessors, (2574), 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) [2022-07-13 21:50:28,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 153.0) internal successors, (4131), 27 states have internal predecessors, (4131), 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) [2022-07-13 21:50:28,357 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 153.0) internal successors, (4131), 27 states have internal predecessors, (4131), 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) [2022-07-13 21:50:28,357 INFO L186 Difference]: Start difference. First operand has 261 places, 277 transitions, 2057 flow. Second operand 26 states and 2574 transitions. [2022-07-13 21:50:28,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 354 transitions, 3622 flow [2022-07-13 21:50:28,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 354 transitions, 3257 flow, removed 170 selfloop flow, removed 18 redundant places. [2022-07-13 21:50:28,408 INFO L242 Difference]: Finished difference. Result has 271 places, 297 transitions, 2320 flow [2022-07-13 21:50:28,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2320, PETRI_PLACES=271, PETRI_TRANSITIONS=297} [2022-07-13 21:50:28,409 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2022-07-13 21:50:28,410 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 297 transitions, 2320 flow [2022-07-13 21:50:28,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 96.82608695652173) internal successors, (2227), 23 states have internal predecessors, (2227), 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) [2022-07-13 21:50:28,410 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:28,411 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:28,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:50:28,411 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash -546886455, now seen corresponding path program 1 times [2022-07-13 21:50:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:28,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456020217] [2022-07-13 21:50:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:28,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456020217] [2022-07-13 21:50:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456020217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:28,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:28,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:50:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337384153] [2022-07-13 21:50:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:50:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:50:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:50:28,554 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153 [2022-07-13 21:50:28,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 297 transitions, 2320 flow. Second operand has 8 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 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) [2022-07-13 21:50:28,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:28,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153 [2022-07-13 21:50:28,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:29,354 INFO L129 PetriNetUnfolder]: 1472/3254 cut-off events. [2022-07-13 21:50:29,354 INFO L130 PetriNetUnfolder]: For 23635/23807 co-relation queries the response was YES. [2022-07-13 21:50:29,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15203 conditions, 3254 events. 1472/3254 cut-off events. For 23635/23807 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22889 event pairs, 61 based on Foata normal form. 112/3340 useless extension candidates. Maximal degree in co-relation 15059. Up to 772 conditions per place. [2022-07-13 21:50:29,388 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 261 selfloop transitions, 15 changer transitions 168/566 dead transitions. [2022-07-13 21:50:29,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 566 transitions, 6551 flow [2022-07-13 21:50:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:50:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 21:50:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1490 transitions. [2022-07-13 21:50:29,390 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8853238265002971 [2022-07-13 21:50:29,391 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1490 transitions. [2022-07-13 21:50:29,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1490 transitions. [2022-07-13 21:50:29,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:29,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1490 transitions. [2022-07-13 21:50:29,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.45454545454547) internal successors, (1490), 11 states have internal predecessors, (1490), 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) [2022-07-13 21:50:29,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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) [2022-07-13 21:50:29,395 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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) [2022-07-13 21:50:29,395 INFO L186 Difference]: Start difference. First operand has 271 places, 297 transitions, 2320 flow. Second operand 11 states and 1490 transitions. [2022-07-13 21:50:29,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 566 transitions, 6551 flow [2022-07-13 21:50:29,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 566 transitions, 6281 flow, removed 100 selfloop flow, removed 22 redundant places. [2022-07-13 21:50:29,443 INFO L242 Difference]: Finished difference. Result has 257 places, 251 transitions, 1869 flow [2022-07-13 21:50:29,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1869, PETRI_PLACES=257, PETRI_TRANSITIONS=251} [2022-07-13 21:50:29,445 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 97 predicate places. [2022-07-13 21:50:29,446 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 1869 flow [2022-07-13 21:50:29,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 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) [2022-07-13 21:50:29,446 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:29,446 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:29,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:50:29,446 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash -171697138, now seen corresponding path program 1 times [2022-07-13 21:50:29,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:29,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942592222] [2022-07-13 21:50:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:29,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942592222] [2022-07-13 21:50:29,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942592222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:29,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:29,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:50:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675736496] [2022-07-13 21:50:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:29,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:50:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:50:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:50:29,554 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 153 [2022-07-13 21:50:29,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 1869 flow. Second operand has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 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) [2022-07-13 21:50:29,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:29,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 153 [2022-07-13 21:50:29,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:30,073 INFO L129 PetriNetUnfolder]: 822/2360 cut-off events. [2022-07-13 21:50:30,074 INFO L130 PetriNetUnfolder]: For 15748/16049 co-relation queries the response was YES. [2022-07-13 21:50:30,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10543 conditions, 2360 events. 822/2360 cut-off events. For 15748/16049 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17600 event pairs, 110 based on Foata normal form. 83/2387 useless extension candidates. Maximal degree in co-relation 10407. Up to 557 conditions per place. [2022-07-13 21:50:30,095 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 206 selfloop transitions, 2 changer transitions 21/364 dead transitions. [2022-07-13 21:50:30,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 364 transitions, 3748 flow [2022-07-13 21:50:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:50:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 21:50:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2022-07-13 21:50:30,097 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8776844070961718 [2022-07-13 21:50:30,097 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2022-07-13 21:50:30,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2022-07-13 21:50:30,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:30,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2022-07-13 21:50:30,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 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) [2022-07-13 21:50:30,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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) [2022-07-13 21:50:30,100 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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) [2022-07-13 21:50:30,100 INFO L186 Difference]: Start difference. First operand has 257 places, 251 transitions, 1869 flow. Second operand 7 states and 940 transitions. [2022-07-13 21:50:30,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 364 transitions, 3748 flow [2022-07-13 21:50:30,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 364 transitions, 3583 flow, removed 69 selfloop flow, removed 25 redundant places. [2022-07-13 21:50:30,135 INFO L242 Difference]: Finished difference. Result has 221 places, 251 transitions, 1769 flow [2022-07-13 21:50:30,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1769, PETRI_PLACES=221, PETRI_TRANSITIONS=251} [2022-07-13 21:50:30,136 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 61 predicate places. [2022-07-13 21:50:30,136 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 251 transitions, 1769 flow [2022-07-13 21:50:30,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 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) [2022-07-13 21:50:30,136 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:30,137 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:30,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:50:30,137 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:30,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 270553314, now seen corresponding path program 2 times [2022-07-13 21:50:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:30,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869435650] [2022-07-13 21:50:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:31,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869435650] [2022-07-13 21:50:31,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869435650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:31,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:31,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-07-13 21:50:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753563793] [2022-07-13 21:50:31,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:31,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 21:50:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 21:50:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2022-07-13 21:50:31,201 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153 [2022-07-13 21:50:31,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 251 transitions, 1769 flow. Second operand has 26 states, 26 states have (on average 94.73076923076923) internal successors, (2463), 26 states have internal predecessors, (2463), 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) [2022-07-13 21:50:31,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:31,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153 [2022-07-13 21:50:31,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:32,808 INFO L129 PetriNetUnfolder]: 591/2223 cut-off events. [2022-07-13 21:50:32,808 INFO L130 PetriNetUnfolder]: For 9502/9843 co-relation queries the response was YES. [2022-07-13 21:50:32,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8047 conditions, 2223 events. 591/2223 cut-off events. For 9502/9843 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18629 event pairs, 129 based on Foata normal form. 142/2305 useless extension candidates. Maximal degree in co-relation 7906. Up to 544 conditions per place. [2022-07-13 21:50:32,829 INFO L132 encePairwiseOnDemand]: 127/153 looper letters, 104 selfloop transitions, 83 changer transitions 20/303 dead transitions. [2022-07-13 21:50:32,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 303 transitions, 2765 flow [2022-07-13 21:50:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 21:50:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-07-13 21:50:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3274 transitions. [2022-07-13 21:50:32,833 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6293733179546328 [2022-07-13 21:50:32,833 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3274 transitions. [2022-07-13 21:50:32,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3274 transitions. [2022-07-13 21:50:32,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:32,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3274 transitions. [2022-07-13 21:50:32,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 96.29411764705883) internal successors, (3274), 34 states have internal predecessors, (3274), 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) [2022-07-13 21:50:32,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 153.0) internal successors, (5355), 35 states have internal predecessors, (5355), 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) [2022-07-13 21:50:32,844 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 153.0) internal successors, (5355), 35 states have internal predecessors, (5355), 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) [2022-07-13 21:50:32,844 INFO L186 Difference]: Start difference. First operand has 221 places, 251 transitions, 1769 flow. Second operand 34 states and 3274 transitions. [2022-07-13 21:50:32,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 303 transitions, 2765 flow [2022-07-13 21:50:32,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 303 transitions, 2746 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-13 21:50:32,872 INFO L242 Difference]: Finished difference. Result has 261 places, 271 transitions, 2332 flow [2022-07-13 21:50:32,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1762, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2332, PETRI_PLACES=261, PETRI_TRANSITIONS=271} [2022-07-13 21:50:32,873 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 101 predicate places. [2022-07-13 21:50:32,874 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 271 transitions, 2332 flow [2022-07-13 21:50:32,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 94.73076923076923) internal successors, (2463), 26 states have internal predecessors, (2463), 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) [2022-07-13 21:50:32,874 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:32,874 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:32,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:50:32,875 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1669637902, now seen corresponding path program 3 times [2022-07-13 21:50:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:32,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025122515] [2022-07-13 21:50:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:33,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025122515] [2022-07-13 21:50:33,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025122515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:33,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:33,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-07-13 21:50:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189327707] [2022-07-13 21:50:33,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:33,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 21:50:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 21:50:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-07-13 21:50:33,859 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153 [2022-07-13 21:50:33,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 271 transitions, 2332 flow. Second operand has 26 states, 26 states have (on average 94.73076923076923) internal successors, (2463), 26 states have internal predecessors, (2463), 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) [2022-07-13 21:50:33,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:33,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153 [2022-07-13 21:50:33,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:35,070 INFO L129 PetriNetUnfolder]: 669/2583 cut-off events. [2022-07-13 21:50:35,070 INFO L130 PetriNetUnfolder]: For 13425/13913 co-relation queries the response was YES. [2022-07-13 21:50:35,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9893 conditions, 2583 events. 669/2583 cut-off events. For 13425/13913 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 23094 event pairs, 144 based on Foata normal form. 137/2648 useless extension candidates. Maximal degree in co-relation 9729. Up to 531 conditions per place. [2022-07-13 21:50:35,096 INFO L132 encePairwiseOnDemand]: 129/153 looper letters, 117 selfloop transitions, 82 changer transitions 13/308 dead transitions. [2022-07-13 21:50:35,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 308 transitions, 3262 flow [2022-07-13 21:50:35,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 21:50:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-07-13 21:50:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2698 transitions. [2022-07-13 21:50:35,099 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6297852474323062 [2022-07-13 21:50:35,099 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2698 transitions. [2022-07-13 21:50:35,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2698 transitions. [2022-07-13 21:50:35,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:35,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2698 transitions. [2022-07-13 21:50:35,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 96.35714285714286) internal successors, (2698), 28 states have internal predecessors, (2698), 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) [2022-07-13 21:50:35,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 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) [2022-07-13 21:50:35,106 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 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) [2022-07-13 21:50:35,106 INFO L186 Difference]: Start difference. First operand has 261 places, 271 transitions, 2332 flow. Second operand 28 states and 2698 transitions. [2022-07-13 21:50:35,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 308 transitions, 3262 flow [2022-07-13 21:50:35,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 308 transitions, 3081 flow, removed 65 selfloop flow, removed 23 redundant places. [2022-07-13 21:50:35,150 INFO L242 Difference]: Finished difference. Result has 265 places, 287 transitions, 2693 flow [2022-07-13 21:50:35,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2693, PETRI_PLACES=265, PETRI_TRANSITIONS=287} [2022-07-13 21:50:35,151 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 105 predicate places. [2022-07-13 21:50:35,151 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 287 transitions, 2693 flow [2022-07-13 21:50:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 94.73076923076923) internal successors, (2463), 26 states have internal predecessors, (2463), 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) [2022-07-13 21:50:35,152 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:35,152 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:35,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 21:50:35,152 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1825103560, now seen corresponding path program 4 times [2022-07-13 21:50:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:35,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647294788] [2022-07-13 21:50:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:35,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647294788] [2022-07-13 21:50:35,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647294788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:35,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-13 21:50:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565608036] [2022-07-13 21:50:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:35,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 21:50:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 21:50:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-07-13 21:50:35,800 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 153 [2022-07-13 21:50:35,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 287 transitions, 2693 flow. Second operand has 22 states, 22 states have (on average 109.72727272727273) internal successors, (2414), 22 states have internal predecessors, (2414), 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) [2022-07-13 21:50:35,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:35,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 153 [2022-07-13 21:50:35,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:36,960 INFO L129 PetriNetUnfolder]: 686/2684 cut-off events. [2022-07-13 21:50:36,961 INFO L130 PetriNetUnfolder]: For 14938/15419 co-relation queries the response was YES. [2022-07-13 21:50:36,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10411 conditions, 2684 events. 686/2684 cut-off events. For 14938/15419 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24570 event pairs, 131 based on Foata normal form. 191/2812 useless extension candidates. Maximal degree in co-relation 10247. Up to 590 conditions per place. [2022-07-13 21:50:36,982 INFO L132 encePairwiseOnDemand]: 132/153 looper letters, 122 selfloop transitions, 76 changer transitions 19/326 dead transitions. [2022-07-13 21:50:36,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 326 transitions, 3575 flow [2022-07-13 21:50:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 21:50:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-07-13 21:50:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3007 transitions. [2022-07-13 21:50:36,984 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7279109174534011 [2022-07-13 21:50:36,984 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3007 transitions. [2022-07-13 21:50:36,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3007 transitions. [2022-07-13 21:50:36,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:36,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3007 transitions. [2022-07-13 21:50:36,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 111.37037037037037) internal successors, (3007), 27 states have internal predecessors, (3007), 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) [2022-07-13 21:50:36,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 153.0) internal successors, (4284), 28 states have internal predecessors, (4284), 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) [2022-07-13 21:50:36,992 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 153.0) internal successors, (4284), 28 states have internal predecessors, (4284), 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) [2022-07-13 21:50:36,992 INFO L186 Difference]: Start difference. First operand has 265 places, 287 transitions, 2693 flow. Second operand 27 states and 3007 transitions. [2022-07-13 21:50:36,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 326 transitions, 3575 flow [2022-07-13 21:50:37,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 326 transitions, 3484 flow, removed 28 selfloop flow, removed 21 redundant places. [2022-07-13 21:50:37,032 INFO L242 Difference]: Finished difference. Result has 277 places, 293 transitions, 2991 flow [2022-07-13 21:50:37,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2638, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2991, PETRI_PLACES=277, PETRI_TRANSITIONS=293} [2022-07-13 21:50:37,033 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 117 predicate places. [2022-07-13 21:50:37,033 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 293 transitions, 2991 flow [2022-07-13 21:50:37,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 109.72727272727273) internal successors, (2414), 22 states have internal predecessors, (2414), 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) [2022-07-13 21:50:37,034 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:37,034 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:37,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 21:50:37,034 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:37,035 INFO L85 PathProgramCache]: Analyzing trace with hash -958924580, now seen corresponding path program 1 times [2022-07-13 21:50:37,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:37,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558922391] [2022-07-13 21:50:37,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:37,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:37,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:37,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558922391] [2022-07-13 21:50:37,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558922391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:37,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:37,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 21:50:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305150545] [2022-07-13 21:50:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:37,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 21:50:37,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 21:50:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:50:37,345 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 153 [2022-07-13 21:50:37,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 293 transitions, 2991 flow. Second operand has 14 states, 14 states have (on average 114.5) internal successors, (1603), 14 states have internal predecessors, (1603), 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) [2022-07-13 21:50:37,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:37,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 153 [2022-07-13 21:50:37,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:38,304 INFO L129 PetriNetUnfolder]: 880/3511 cut-off events. [2022-07-13 21:50:38,304 INFO L130 PetriNetUnfolder]: For 21370/22060 co-relation queries the response was YES. [2022-07-13 21:50:38,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13744 conditions, 3511 events. 880/3511 cut-off events. For 21370/22060 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 34375 event pairs, 168 based on Foata normal form. 211/3628 useless extension candidates. Maximal degree in co-relation 13576. Up to 543 conditions per place. [2022-07-13 21:50:38,346 INFO L132 encePairwiseOnDemand]: 140/153 looper letters, 136 selfloop transitions, 87 changer transitions 10/346 dead transitions. [2022-07-13 21:50:38,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 346 transitions, 4101 flow [2022-07-13 21:50:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:50:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:50:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1766 transitions. [2022-07-13 21:50:38,348 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7694989106753812 [2022-07-13 21:50:38,348 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1766 transitions. [2022-07-13 21:50:38,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1766 transitions. [2022-07-13 21:50:38,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:38,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1766 transitions. [2022-07-13 21:50:38,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 117.73333333333333) internal successors, (1766), 15 states have internal predecessors, (1766), 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) [2022-07-13 21:50:38,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 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) [2022-07-13 21:50:38,353 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 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) [2022-07-13 21:50:38,353 INFO L186 Difference]: Start difference. First operand has 277 places, 293 transitions, 2991 flow. Second operand 15 states and 1766 transitions. [2022-07-13 21:50:38,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 346 transitions, 4101 flow [2022-07-13 21:50:38,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 346 transitions, 3922 flow, removed 79 selfloop flow, removed 23 redundant places. [2022-07-13 21:50:38,422 INFO L242 Difference]: Finished difference. Result has 268 places, 303 transitions, 3378 flow [2022-07-13 21:50:38,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2906, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3378, PETRI_PLACES=268, PETRI_TRANSITIONS=303} [2022-07-13 21:50:38,422 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2022-07-13 21:50:38,423 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 303 transitions, 3378 flow [2022-07-13 21:50:38,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 114.5) internal successors, (1603), 14 states have internal predecessors, (1603), 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) [2022-07-13 21:50:38,423 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:38,423 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:38,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 21:50:38,424 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1808403152, now seen corresponding path program 2 times [2022-07-13 21:50:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:38,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004383226] [2022-07-13 21:50:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:38,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004383226] [2022-07-13 21:50:38,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004383226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:38,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:38,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 21:50:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256114095] [2022-07-13 21:50:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:38,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 21:50:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 21:50:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:50:38,702 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 153 [2022-07-13 21:50:38,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 303 transitions, 3378 flow. Second operand has 14 states, 14 states have (on average 113.57142857142857) internal successors, (1590), 14 states have internal predecessors, (1590), 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) [2022-07-13 21:50:38,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:38,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 153 [2022-07-13 21:50:38,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:39,805 INFO L129 PetriNetUnfolder]: 974/3886 cut-off events. [2022-07-13 21:50:39,806 INFO L130 PetriNetUnfolder]: For 27272/28135 co-relation queries the response was YES. [2022-07-13 21:50:39,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15618 conditions, 3886 events. 974/3886 cut-off events. For 27272/28135 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 39098 event pairs, 153 based on Foata normal form. 221/3997 useless extension candidates. Maximal degree in co-relation 15459. Up to 605 conditions per place. [2022-07-13 21:50:39,846 INFO L132 encePairwiseOnDemand]: 141/153 looper letters, 137 selfloop transitions, 88 changer transitions 11/348 dead transitions. [2022-07-13 21:50:39,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 348 transitions, 4353 flow [2022-07-13 21:50:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:50:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:50:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1750 transitions. [2022-07-13 21:50:39,848 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7625272331154684 [2022-07-13 21:50:39,848 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1750 transitions. [2022-07-13 21:50:39,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1750 transitions. [2022-07-13 21:50:39,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:39,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1750 transitions. [2022-07-13 21:50:39,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.66666666666667) internal successors, (1750), 15 states have internal predecessors, (1750), 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) [2022-07-13 21:50:39,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 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) [2022-07-13 21:50:39,852 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 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) [2022-07-13 21:50:39,852 INFO L186 Difference]: Start difference. First operand has 268 places, 303 transitions, 3378 flow. Second operand 15 states and 1750 transitions. [2022-07-13 21:50:39,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 348 transitions, 4353 flow [2022-07-13 21:50:39,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 348 transitions, 4144 flow, removed 64 selfloop flow, removed 11 redundant places. [2022-07-13 21:50:39,918 INFO L242 Difference]: Finished difference. Result has 274 places, 307 transitions, 3555 flow [2022-07-13 21:50:39,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3241, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3555, PETRI_PLACES=274, PETRI_TRANSITIONS=307} [2022-07-13 21:50:39,919 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 114 predicate places. [2022-07-13 21:50:39,919 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 307 transitions, 3555 flow [2022-07-13 21:50:39,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 113.57142857142857) internal successors, (1590), 14 states have internal predecessors, (1590), 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) [2022-07-13 21:50:39,919 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:39,920 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:39,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 21:50:39,920 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1184845460, now seen corresponding path program 3 times [2022-07-13 21:50:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:39,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256089677] [2022-07-13 21:50:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:40,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256089677] [2022-07-13 21:50:40,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256089677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:40,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:40,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:50:40,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999879590] [2022-07-13 21:50:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:40,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:50:40,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:40,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:50:40,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:50:40,057 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 153 [2022-07-13 21:50:40,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 307 transitions, 3555 flow. Second operand has 9 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 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) [2022-07-13 21:50:40,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:40,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 153 [2022-07-13 21:50:40,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:41,290 INFO L129 PetriNetUnfolder]: 2563/6277 cut-off events. [2022-07-13 21:50:41,290 INFO L130 PetriNetUnfolder]: For 86493/87226 co-relation queries the response was YES. [2022-07-13 21:50:41,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34199 conditions, 6277 events. 2563/6277 cut-off events. For 86493/87226 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 58848 event pairs, 139 based on Foata normal form. 137/6348 useless extension candidates. Maximal degree in co-relation 34121. Up to 1449 conditions per place. [2022-07-13 21:50:41,344 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 353 selfloop transitions, 19 changer transitions 119/620 dead transitions. [2022-07-13 21:50:41,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 620 transitions, 10550 flow [2022-07-13 21:50:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:50:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-13 21:50:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1585 transitions. [2022-07-13 21:50:41,345 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8632897603485838 [2022-07-13 21:50:41,345 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1585 transitions. [2022-07-13 21:50:41,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1585 transitions. [2022-07-13 21:50:41,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:41,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1585 transitions. [2022-07-13 21:50:41,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 132.08333333333334) internal successors, (1585), 12 states have internal predecessors, (1585), 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) [2022-07-13 21:50:41,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 153.0) internal successors, (1989), 13 states have internal predecessors, (1989), 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) [2022-07-13 21:50:41,349 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 153.0) internal successors, (1989), 13 states have internal predecessors, (1989), 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) [2022-07-13 21:50:41,349 INFO L186 Difference]: Start difference. First operand has 274 places, 307 transitions, 3555 flow. Second operand 12 states and 1585 transitions. [2022-07-13 21:50:41,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 620 transitions, 10550 flow [2022-07-13 21:50:41,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 620 transitions, 9878 flow, removed 123 selfloop flow, removed 16 redundant places. [2022-07-13 21:50:41,492 INFO L242 Difference]: Finished difference. Result has 269 places, 297 transitions, 3252 flow [2022-07-13 21:50:41,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3316, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3252, PETRI_PLACES=269, PETRI_TRANSITIONS=297} [2022-07-13 21:50:41,493 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 109 predicate places. [2022-07-13 21:50:41,493 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 297 transitions, 3252 flow [2022-07-13 21:50:41,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 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) [2022-07-13 21:50:41,493 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:41,493 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:41,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 21:50:41,493 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash 282394597, now seen corresponding path program 1 times [2022-07-13 21:50:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:41,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359305677] [2022-07-13 21:50:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:41,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:41,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359305677] [2022-07-13 21:50:41,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359305677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:41,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:41,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 21:50:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871702099] [2022-07-13 21:50:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:41,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 21:50:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:41,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 21:50:41,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:50:41,975 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-07-13 21:50:41,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 297 transitions, 3252 flow. Second operand has 16 states, 16 states have (on average 103.625) internal successors, (1658), 16 states have internal predecessors, (1658), 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) [2022-07-13 21:50:41,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:41,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-07-13 21:50:41,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:43,082 INFO L129 PetriNetUnfolder]: 1195/4650 cut-off events. [2022-07-13 21:50:43,083 INFO L130 PetriNetUnfolder]: For 23223/24145 co-relation queries the response was YES. [2022-07-13 21:50:43,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17911 conditions, 4650 events. 1195/4650 cut-off events. For 23223/24145 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 51755 event pairs, 104 based on Foata normal form. 118/4592 useless extension candidates. Maximal degree in co-relation 17754. Up to 824 conditions per place. [2022-07-13 21:50:43,122 INFO L132 encePairwiseOnDemand]: 137/153 looper letters, 139 selfloop transitions, 75 changer transitions 38/353 dead transitions. [2022-07-13 21:50:43,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 353 transitions, 4434 flow [2022-07-13 21:50:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:50:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:50:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1596 transitions. [2022-07-13 21:50:43,124 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6954248366013072 [2022-07-13 21:50:43,125 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1596 transitions. [2022-07-13 21:50:43,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1596 transitions. [2022-07-13 21:50:43,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:43,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1596 transitions. [2022-07-13 21:50:43,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 106.4) internal successors, (1596), 15 states have internal predecessors, (1596), 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) [2022-07-13 21:50:43,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 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) [2022-07-13 21:50:43,128 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 153.0) internal successors, (2448), 16 states have internal predecessors, (2448), 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) [2022-07-13 21:50:43,128 INFO L186 Difference]: Start difference. First operand has 269 places, 297 transitions, 3252 flow. Second operand 15 states and 1596 transitions. [2022-07-13 21:50:43,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 353 transitions, 4434 flow [2022-07-13 21:50:43,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 353 transitions, 3807 flow, removed 265 selfloop flow, removed 23 redundant places. [2022-07-13 21:50:43,243 INFO L242 Difference]: Finished difference. Result has 262 places, 301 transitions, 3083 flow [2022-07-13 21:50:43,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2779, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3083, PETRI_PLACES=262, PETRI_TRANSITIONS=301} [2022-07-13 21:50:43,243 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 102 predicate places. [2022-07-13 21:50:43,243 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 301 transitions, 3083 flow [2022-07-13 21:50:43,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 103.625) internal successors, (1658), 16 states have internal predecessors, (1658), 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) [2022-07-13 21:50:43,244 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:43,244 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:43,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 21:50:43,244 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1042802659, now seen corresponding path program 2 times [2022-07-13 21:50:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:43,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872060010] [2022-07-13 21:50:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:43,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:43,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872060010] [2022-07-13 21:50:43,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872060010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:43,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:43,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-13 21:50:43,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811724895] [2022-07-13 21:50:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:43,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 21:50:43,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 21:50:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-07-13 21:50:43,759 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 153 [2022-07-13 21:50:43,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 301 transitions, 3083 flow. Second operand has 21 states, 21 states have (on average 100.0) internal successors, (2100), 21 states have internal predecessors, (2100), 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) [2022-07-13 21:50:43,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:43,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 153 [2022-07-13 21:50:43,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:44,976 INFO L129 PetriNetUnfolder]: 1279/5136 cut-off events. [2022-07-13 21:50:44,976 INFO L130 PetriNetUnfolder]: For 16263/16734 co-relation queries the response was YES. [2022-07-13 21:50:45,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14371 conditions, 5136 events. 1279/5136 cut-off events. For 16263/16734 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 59221 event pairs, 67 based on Foata normal form. 151/5124 useless extension candidates. Maximal degree in co-relation 14309. Up to 824 conditions per place. [2022-07-13 21:50:45,029 INFO L132 encePairwiseOnDemand]: 133/153 looper letters, 198 selfloop transitions, 91 changer transitions 18/408 dead transitions. [2022-07-13 21:50:45,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 408 transitions, 5143 flow [2022-07-13 21:50:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 21:50:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-13 21:50:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1857 transitions. [2022-07-13 21:50:45,031 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6742919389978214 [2022-07-13 21:50:45,031 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1857 transitions. [2022-07-13 21:50:45,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1857 transitions. [2022-07-13 21:50:45,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:45,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1857 transitions. [2022-07-13 21:50:45,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 103.16666666666667) internal successors, (1857), 18 states have internal predecessors, (1857), 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) [2022-07-13 21:50:45,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 153.0) internal successors, (2907), 19 states have internal predecessors, (2907), 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) [2022-07-13 21:50:45,035 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 153.0) internal successors, (2907), 19 states have internal predecessors, (2907), 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) [2022-07-13 21:50:45,035 INFO L186 Difference]: Start difference. First operand has 262 places, 301 transitions, 3083 flow. Second operand 18 states and 1857 transitions. [2022-07-13 21:50:45,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 408 transitions, 5143 flow [2022-07-13 21:50:45,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 408 transitions, 4967 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-07-13 21:50:45,096 INFO L242 Difference]: Finished difference. Result has 267 places, 345 transitions, 4089 flow [2022-07-13 21:50:45,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2966, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4089, PETRI_PLACES=267, PETRI_TRANSITIONS=345} [2022-07-13 21:50:45,096 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 107 predicate places. [2022-07-13 21:50:45,097 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 345 transitions, 4089 flow [2022-07-13 21:50:45,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 100.0) internal successors, (2100), 21 states have internal predecessors, (2100), 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) [2022-07-13 21:50:45,097 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:45,097 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:45,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 21:50:45,097 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1187202293, now seen corresponding path program 3 times [2022-07-13 21:50:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:45,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443580970] [2022-07-13 21:50:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:45,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443580970] [2022-07-13 21:50:45,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443580970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:45,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:45,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-13 21:50:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618827543] [2022-07-13 21:50:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:45,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 21:50:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 21:50:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-07-13 21:50:45,669 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-07-13 21:50:45,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 345 transitions, 4089 flow. Second operand has 21 states, 21 states have (on average 96.19047619047619) internal successors, (2020), 21 states have internal predecessors, (2020), 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) [2022-07-13 21:50:45,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:45,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-07-13 21:50:45,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:47,121 INFO L129 PetriNetUnfolder]: 1463/5966 cut-off events. [2022-07-13 21:50:47,121 INFO L130 PetriNetUnfolder]: For 17983/18468 co-relation queries the response was YES. [2022-07-13 21:50:47,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16214 conditions, 5966 events. 1463/5966 cut-off events. For 17983/18468 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 71046 event pairs, 113 based on Foata normal form. 172/5916 useless extension candidates. Maximal degree in co-relation 16152. Up to 964 conditions per place. [2022-07-13 21:50:47,178 INFO L132 encePairwiseOnDemand]: 133/153 looper letters, 142 selfloop transitions, 123 changer transitions 22/384 dead transitions. [2022-07-13 21:50:47,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 384 transitions, 5002 flow [2022-07-13 21:50:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 21:50:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-13 21:50:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1971 transitions. [2022-07-13 21:50:47,186 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6441176470588236 [2022-07-13 21:50:47,186 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1971 transitions. [2022-07-13 21:50:47,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1971 transitions. [2022-07-13 21:50:47,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:47,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1971 transitions. [2022-07-13 21:50:47,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 98.55) internal successors, (1971), 20 states have internal predecessors, (1971), 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) [2022-07-13 21:50:47,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 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) [2022-07-13 21:50:47,191 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 153.0) internal successors, (3213), 21 states have internal predecessors, (3213), 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) [2022-07-13 21:50:47,191 INFO L186 Difference]: Start difference. First operand has 267 places, 345 transitions, 4089 flow. Second operand 20 states and 1971 transitions. [2022-07-13 21:50:47,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 384 transitions, 5002 flow [2022-07-13 21:50:47,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 384 transitions, 4928 flow, removed 30 selfloop flow, removed 10 redundant places. [2022-07-13 21:50:47,266 INFO L242 Difference]: Finished difference. Result has 282 places, 352 transitions, 4436 flow [2022-07-13 21:50:47,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4039, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4436, PETRI_PLACES=282, PETRI_TRANSITIONS=352} [2022-07-13 21:50:47,266 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 122 predicate places. [2022-07-13 21:50:47,266 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 352 transitions, 4436 flow [2022-07-13 21:50:47,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 96.19047619047619) internal successors, (2020), 21 states have internal predecessors, (2020), 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) [2022-07-13 21:50:47,267 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:47,267 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:47,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 21:50:47,267 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 896259625, now seen corresponding path program 4 times [2022-07-13 21:50:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:47,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947323074] [2022-07-13 21:50:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:47,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947323074] [2022-07-13 21:50:47,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947323074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:47,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:47,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-13 21:50:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369614926] [2022-07-13 21:50:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:47,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 21:50:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:47,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 21:50:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-13 21:50:47,984 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-07-13 21:50:47,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 352 transitions, 4436 flow. Second operand has 22 states, 22 states have (on average 96.13636363636364) internal successors, (2115), 22 states have internal predecessors, (2115), 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) [2022-07-13 21:50:47,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:47,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-07-13 21:50:47,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:49,844 INFO L129 PetriNetUnfolder]: 1505/6159 cut-off events. [2022-07-13 21:50:49,845 INFO L130 PetriNetUnfolder]: For 21637/22223 co-relation queries the response was YES. [2022-07-13 21:50:49,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16962 conditions, 6159 events. 1505/6159 cut-off events. For 21637/22223 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 74055 event pairs, 92 based on Foata normal form. 203/6130 useless extension candidates. Maximal degree in co-relation 16895. Up to 1008 conditions per place. [2022-07-13 21:50:49,899 INFO L132 encePairwiseOnDemand]: 134/153 looper letters, 157 selfloop transitions, 107 changer transitions 55/415 dead transitions. [2022-07-13 21:50:49,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 415 transitions, 5650 flow [2022-07-13 21:50:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 21:50:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-07-13 21:50:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2274 transitions. [2022-07-13 21:50:49,901 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6462063086104007 [2022-07-13 21:50:49,901 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2274 transitions. [2022-07-13 21:50:49,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2274 transitions. [2022-07-13 21:50:49,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:49,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2274 transitions. [2022-07-13 21:50:49,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 98.8695652173913) internal successors, (2274), 23 states have internal predecessors, (2274), 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) [2022-07-13 21:50:49,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 153.0) internal successors, (3672), 24 states have internal predecessors, (3672), 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) [2022-07-13 21:50:49,906 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 153.0) internal successors, (3672), 24 states have internal predecessors, (3672), 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) [2022-07-13 21:50:49,906 INFO L186 Difference]: Start difference. First operand has 282 places, 352 transitions, 4436 flow. Second operand 23 states and 2274 transitions. [2022-07-13 21:50:49,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 415 transitions, 5650 flow [2022-07-13 21:50:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 415 transitions, 5561 flow, removed 38 selfloop flow, removed 13 redundant places. [2022-07-13 21:50:49,999 INFO L242 Difference]: Finished difference. Result has 296 places, 335 transitions, 4517 flow [2022-07-13 21:50:50,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4383, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4517, PETRI_PLACES=296, PETRI_TRANSITIONS=335} [2022-07-13 21:50:50,000 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 136 predicate places. [2022-07-13 21:50:50,000 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 335 transitions, 4517 flow [2022-07-13 21:50:50,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 96.13636363636364) internal successors, (2115), 22 states have internal predecessors, (2115), 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) [2022-07-13 21:50:50,001 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:50,001 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:50,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 21:50:50,001 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1236832917, now seen corresponding path program 5 times [2022-07-13 21:50:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:50,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27671698] [2022-07-13 21:50:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:50,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:50,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:50,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27671698] [2022-07-13 21:50:50,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27671698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:50,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:50,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-13 21:50:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909474805] [2022-07-13 21:50:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:50,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 21:50:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 21:50:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-07-13 21:50:50,519 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 153 [2022-07-13 21:50:50,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 335 transitions, 4517 flow. Second operand has 20 states, 20 states have (on average 100.2) internal successors, (2004), 20 states have internal predecessors, (2004), 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) [2022-07-13 21:50:50,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:50,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 153 [2022-07-13 21:50:50,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:51,906 INFO L129 PetriNetUnfolder]: 1406/5783 cut-off events. [2022-07-13 21:50:51,906 INFO L130 PetriNetUnfolder]: For 24872/25309 co-relation queries the response was YES. [2022-07-13 21:50:51,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16463 conditions, 5783 events. 1406/5783 cut-off events. For 24872/25309 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 69012 event pairs, 90 based on Foata normal form. 176/5756 useless extension candidates. Maximal degree in co-relation 16383. Up to 948 conditions per place. [2022-07-13 21:50:51,947 INFO L132 encePairwiseOnDemand]: 133/153 looper letters, 187 selfloop transitions, 90 changer transitions 25/401 dead transitions. [2022-07-13 21:50:51,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 401 transitions, 5900 flow [2022-07-13 21:50:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:50:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-13 21:50:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1762 transitions. [2022-07-13 21:50:51,949 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6774317570165321 [2022-07-13 21:50:51,949 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1762 transitions. [2022-07-13 21:50:51,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1762 transitions. [2022-07-13 21:50:51,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:51,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1762 transitions. [2022-07-13 21:50:51,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 103.6470588235294) internal successors, (1762), 17 states have internal predecessors, (1762), 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) [2022-07-13 21:50:51,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 153.0) internal successors, (2754), 18 states have internal predecessors, (2754), 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) [2022-07-13 21:50:51,953 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 153.0) internal successors, (2754), 18 states have internal predecessors, (2754), 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) [2022-07-13 21:50:51,953 INFO L186 Difference]: Start difference. First operand has 296 places, 335 transitions, 4517 flow. Second operand 17 states and 1762 transitions. [2022-07-13 21:50:51,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 401 transitions, 5900 flow [2022-07-13 21:50:52,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 401 transitions, 5607 flow, removed 47 selfloop flow, removed 28 redundant places. [2022-07-13 21:50:52,050 INFO L242 Difference]: Finished difference. Result has 276 places, 351 transitions, 4807 flow [2022-07-13 21:50:52,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4317, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4807, PETRI_PLACES=276, PETRI_TRANSITIONS=351} [2022-07-13 21:50:52,050 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 116 predicate places. [2022-07-13 21:50:52,050 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 351 transitions, 4807 flow [2022-07-13 21:50:52,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 100.2) internal successors, (2004), 20 states have internal predecessors, (2004), 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) [2022-07-13 21:50:52,051 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:52,051 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:52,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 21:50:52,051 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1716831195, now seen corresponding path program 6 times [2022-07-13 21:50:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:52,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513037146] [2022-07-13 21:50:52,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:50:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:50:53,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:50:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513037146] [2022-07-13 21:50:53,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513037146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:50:53,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:50:53,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-07-13 21:50:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224860683] [2022-07-13 21:50:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:50:53,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 21:50:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:50:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 21:50:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-07-13 21:50:53,164 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153 [2022-07-13 21:50:53,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 351 transitions, 4807 flow. Second operand has 24 states, 24 states have (on average 94.08333333333333) internal successors, (2258), 24 states have internal predecessors, (2258), 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) [2022-07-13 21:50:53,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:50:53,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153 [2022-07-13 21:50:53,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:50:54,772 INFO L129 PetriNetUnfolder]: 1465/5944 cut-off events. [2022-07-13 21:50:54,772 INFO L130 PetriNetUnfolder]: For 25953/26437 co-relation queries the response was YES. [2022-07-13 21:50:54,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17216 conditions, 5944 events. 1465/5944 cut-off events. For 25953/26437 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 71453 event pairs, 59 based on Foata normal form. 144/5869 useless extension candidates. Maximal degree in co-relation 17144. Up to 978 conditions per place. [2022-07-13 21:50:54,836 INFO L132 encePairwiseOnDemand]: 131/153 looper letters, 173 selfloop transitions, 126 changer transitions 11/403 dead transitions. [2022-07-13 21:50:54,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 403 transitions, 5943 flow [2022-07-13 21:50:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 21:50:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-13 21:50:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2508 transitions. [2022-07-13 21:50:54,838 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6304675716440422 [2022-07-13 21:50:54,838 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2508 transitions. [2022-07-13 21:50:54,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2508 transitions. [2022-07-13 21:50:54,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:50:54,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2508 transitions. [2022-07-13 21:50:54,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 96.46153846153847) internal successors, (2508), 26 states have internal predecessors, (2508), 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) [2022-07-13 21:50:54,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 153.0) internal successors, (4131), 27 states have internal predecessors, (4131), 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) [2022-07-13 21:50:54,844 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 153.0) internal successors, (4131), 27 states have internal predecessors, (4131), 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) [2022-07-13 21:50:54,844 INFO L186 Difference]: Start difference. First operand has 276 places, 351 transitions, 4807 flow. Second operand 26 states and 2508 transitions. [2022-07-13 21:50:54,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 403 transitions, 5943 flow [2022-07-13 21:50:55,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 403 transitions, 5723 flow, removed 66 selfloop flow, removed 13 redundant places. [2022-07-13 21:50:55,022 INFO L242 Difference]: Finished difference. Result has 295 places, 372 transitions, 5229 flow [2022-07-13 21:50:55,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4607, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5229, PETRI_PLACES=295, PETRI_TRANSITIONS=372} [2022-07-13 21:50:55,023 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 135 predicate places. [2022-07-13 21:50:55,023 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 372 transitions, 5229 flow [2022-07-13 21:50:55,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 94.08333333333333) internal successors, (2258), 24 states have internal predecessors, (2258), 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) [2022-07-13 21:50:55,023 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:50:55,023 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:55,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 21:50:55,024 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:50:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:50:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash 992789261, now seen corresponding path program 7 times [2022-07-13 21:50:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:50:55,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568569492] [2022-07-13 21:50:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:50:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:50:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:50:55,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:50:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:50:55,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:50:55,265 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:50:55,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-13 21:50:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-13 21:50:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-13 21:50:55,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-13 21:50:55,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-13 21:50:55,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-13 21:50:55,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-13 21:50:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 21:50:55,269 INFO L356 BasicCegarLoop]: Path program histogram: [7, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:50:55,273 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:50:55,273 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:50:55,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:50:55 BasicIcfg [2022-07-13 21:50:55,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:50:55,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:50:55,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:50:55,445 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:50:55,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:50:13" (3/4) ... [2022-07-13 21:50:55,447 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:50:55,606 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:50:55,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:50:55,607 INFO L158 Benchmark]: Toolchain (without parser) took 43558.70ms. Allocated memory was 107.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 72.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 492.8MB. Max. memory is 16.1GB. [2022-07-13 21:50:55,607 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:50:55,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.53ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 66.1MB in the end (delta: 6.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:50:55,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.59ms. Allocated memory is still 107.0MB. Free memory was 66.1MB in the beginning and 63.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:50:55,608 INFO L158 Benchmark]: Boogie Preprocessor took 52.92ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 59.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:50:55,608 INFO L158 Benchmark]: RCFGBuilder took 1072.50ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 85.8MB in the end (delta: -26.0MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-07-13 21:50:55,608 INFO L158 Benchmark]: TraceAbstraction took 41729.34ms. Allocated memory was 136.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 84.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 368.6MB. Max. memory is 16.1GB. [2022-07-13 21:50:55,609 INFO L158 Benchmark]: Witness Printer took 161.95ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 107.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2022-07-13 21:50:55,613 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.09ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.53ms. Allocated memory is still 107.0MB. Free memory was 72.5MB in the beginning and 66.1MB in the end (delta: 6.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.59ms. Allocated memory is still 107.0MB. Free memory was 66.1MB in the beginning and 63.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.92ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 59.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1072.50ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 85.8MB in the end (delta: -26.0MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 41729.34ms. Allocated memory was 136.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 84.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 368.6MB. Max. memory is 16.1GB. * Witness Printer took 161.95ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 107.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L713] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L715] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0] [L719] 0 int __unbuffered_p2_EAX$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0] [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0] [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0] [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0] [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0] [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0] [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0] [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0] [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0] [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0] [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0] [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0] [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}] [L732] 0 int __unbuffered_p2_EAX$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0] [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0] [L734] 0 int __unbuffered_p2_EAX$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0] [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0] [L737] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0] [L738] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L739] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L741] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}] [L742] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0] [L743] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0] [L744] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L745] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L746] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L747] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L748] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L749] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L750] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L751] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L752] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L753] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L754] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L755] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L756] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L757] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L758] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L759] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L761] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 0 _Bool weak$$choice1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L884] 0 pthread_t t2421; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-3, t2421={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2422; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={6:0}, t2422={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-2, t2421={6:0}, t2422={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2423; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=-1, t2421={6:0}, t2422={7:0}, t2423={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L890] 0 pthread_t t2424; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L859] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={6:0}, t2422={7:0}, t2423={8:0}, t2424={5:0}, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 889]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 891]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 186 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.4s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2187 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2187 mSDsluCounter, 3673 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5001 mSDsCounter, 1169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10009 IncrementalHoareTripleChecker+Invalid, 11178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1169 mSolverCounterUnsat, 500 mSDtfsCounter, 10009 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3367 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5229occurred in iteration=25, InterpolantAutomatonStates: 454, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2995 NumberOfCodeBlocks, 2995 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2848 ConstructedInterpolants, 0 QuantifiedInterpolants, 35618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:50:55,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE