./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.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 40f0a1ff0b59c9897722e1cc89a9065b61569e5c28581990c7adb84261d57e0b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:50:51,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:50:51,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:50:51,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:50:51,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:50:51,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:50:51,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:50:51,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:50:51,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:50:51,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:50:51,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:50:51,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:50:51,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:50:51,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:50:51,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:50:51,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:50:51,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:50:51,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:50:51,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:50:51,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:50:51,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:50:51,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:50:51,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:50:51,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:50:51,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:50:51,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:50:51,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:50:51,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:50:51,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:50:51,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:50:51,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:50:51,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:50:51,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:50:51,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:50:51,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:50:51,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:50:51,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:50:51,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:50:51,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:50:51,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:50:51,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:50:51,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:50:51,795 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:50:51,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:50:51,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:50:51,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:50:51,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:50:51,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:50:51,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:50:51,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:50:51,798 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:50:51,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:50:51,799 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:50:51,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:50:51,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:50:51,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:50:51,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:50:51,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:50:51,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:50:51,801 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:50:51,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:50:51,801 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:50:51,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:50:51,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:50:51,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:50:51,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:50:51,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:50:51,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:50:51,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:50:51,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:50:51,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:50:51,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:50:51,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:50:51,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:50:51,803 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:50:51,803 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:50:51,804 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:50:51,804 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 40f0a1ff0b59c9897722e1cc89a9065b61569e5c28581990c7adb84261d57e0b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:50:52,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:50:52,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:50:52,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:50:52,145 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:50:52,145 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:50:52,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:50:53,333 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:50:53,617 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:50:53,618 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:50:53,638 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe34697c2/bec835db49714302b7513a11066870ce/FLAG2937535f3 [2023-09-01 09:50:53,657 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe34697c2/bec835db49714302b7513a11066870ce [2023-09-01 09:50:53,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:50:53,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:50:53,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:50:53,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:50:53,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:50:53,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:50:53" (1/1) ... [2023-09-01 09:50:53,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f19452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:53, skipping insertion in model container [2023-09-01 09:50:53,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:50:53" (1/1) ... [2023-09-01 09:50:53,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:50:53,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:50:53,875 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:50:54,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:50:54,103 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:50:54,113 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:50:54,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:50:54,212 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:50:54,215 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:50:54,220 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:50:54,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54 WrapperNode [2023-09-01 09:50:54,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:50:54,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:50:54,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:50:54,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:50:54,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,261 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-09-01 09:50:54,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:50:54,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:50:54,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:50:54,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:50:54,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,314 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:50:54,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:50:54,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:50:54,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:50:54,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (1/1) ... [2023-09-01 09:50:54,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:50:54,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:50:54,374 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) [2023-09-01 09:50:54,376 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 [2023-09-01 09:50:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:50:54,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:50:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:50:54,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:50:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:50:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:50:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:50:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:50:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:50:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:50:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:50:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:50:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:50:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:50:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:50:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:50:54,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:50:54,410 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:50:54,533 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:50:54,535 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:50:54,959 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:50:55,122 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:50:55,122 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:50:55,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:50:55 BoogieIcfgContainer [2023-09-01 09:50:55,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:50:55,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:50:55,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:50:55,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:50:55,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:50:53" (1/3) ... [2023-09-01 09:50:55,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1061b371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:50:55, skipping insertion in model container [2023-09-01 09:50:55,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:50:54" (2/3) ... [2023-09-01 09:50:55,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1061b371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:50:55, skipping insertion in model container [2023-09-01 09:50:55,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:50:55" (3/3) ... [2023-09-01 09:50:55,134 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:50:55,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:50:55,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:50:55,151 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:50:55,151 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:50:55,215 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:50:55,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-09-01 09:50:55,330 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-09-01 09:50:55,330 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:50:55,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-09-01 09:50:55,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-09-01 09:50:55,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-09-01 09:50:55,347 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:50:55,360 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-09-01 09:50:55,364 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-09-01 09:50:55,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-09-01 09:50:55,420 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-09-01 09:50:55,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:50:55,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-09-01 09:50:55,429 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-09-01 09:50:59,258 INFO L134 LiptonReduction]: Checked pairs total: 8670 [2023-09-01 09:50:59,258 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-09-01 09:50:59,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:50:59,276 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d50db1b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:50:59,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:50:59,280 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-09-01 09:50:59,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:50:59,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:50:59,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:50:59,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:50:59,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:50:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash 553466, now seen corresponding path program 1 times [2023-09-01 09:50:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:50:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901689619] [2023-09-01 09:50:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:50:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:50:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:50:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:50:59,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:50:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901689619] [2023-09-01 09:50:59,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901689619] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:50:59,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:50:59,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:50:59,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443000124] [2023-09-01 09:50:59,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:50:59,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:50:59,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:50:59,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:50:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:50:59,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-09-01 09:50:59,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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) [2023-09-01 09:50:59,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:50:59,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-09-01 09:50:59,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:00,775 INFO L130 PetriNetUnfolder]: 5879/8107 cut-off events. [2023-09-01 09:51:00,776 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-09-01 09:51:00,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8107 events. 5879/8107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40886 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16239. Up to 6367 conditions per place. [2023-09-01 09:51:00,825 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-09-01 09:51:00,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-09-01 09:51:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:51:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:51:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-09-01 09:51:00,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482093663911846 [2023-09-01 09:51:00,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-09-01 09:51:00,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-09-01 09:51:00,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:00,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-09-01 09:51:00,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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) [2023-09-01 09:51:00,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:00,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:00,853 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 398 transitions. [2023-09-01 09:51:00,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-09-01 09:51:00,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:51:00,859 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-09-01 09:51:00,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-09-01 09:51:00,864 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-09-01 09:51:00,865 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-09-01 09:51:00,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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) [2023-09-01 09:51:00,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:00,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:00,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:51:00,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:00,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash -301813989, now seen corresponding path program 1 times [2023-09-01 09:51:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055754747] [2023-09-01 09:51:00,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:01,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055754747] [2023-09-01 09:51:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055754747] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:01,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:01,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:51:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245327218] [2023-09-01 09:51:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:01,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:51:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:01,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:51:01,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:51:01,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-09-01 09:51:01,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2023-09-01 09:51:01,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:01,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-09-01 09:51:01,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:03,557 INFO L130 PetriNetUnfolder]: 16407/22321 cut-off events. [2023-09-01 09:51:03,558 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2023-09-01 09:51:03,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46179 conditions, 22321 events. 16407/22321 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 117777 event pairs, 5637 based on Foata normal form. 634/22955 useless extension candidates. Maximal degree in co-relation 46169. Up to 13398 conditions per place. [2023-09-01 09:51:03,707 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-09-01 09:51:03,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-09-01 09:51:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:51:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:51:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-09-01 09:51:03,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509641873278237 [2023-09-01 09:51:03,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-09-01 09:51:03,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-09-01 09:51:03,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:03,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-09-01 09:51:03,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-09-01 09:51:03,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:03,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:03,715 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 370 transitions. [2023-09-01 09:51:03,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-09-01 09:51:03,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:03,717 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2023-09-01 09:51:03,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-09-01 09:51:03,718 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-09-01 09:51:03,718 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2023-09-01 09:51:03,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2023-09-01 09:51:03,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:03,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:03,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:51:03,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:03,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -766301216, now seen corresponding path program 1 times [2023-09-01 09:51:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:03,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763177399] [2023-09-01 09:51:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:04,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763177399] [2023-09-01 09:51:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763177399] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:04,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:04,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:51:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065622063] [2023-09-01 09:51:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:04,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:51:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:51:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:51:04,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-09-01 09:51:04,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-09-01 09:51:04,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:04,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-09-01 09:51:04,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:06,004 INFO L130 PetriNetUnfolder]: 16149/21975 cut-off events. [2023-09-01 09:51:06,005 INFO L131 PetriNetUnfolder]: For 8493/8493 co-relation queries the response was YES. [2023-09-01 09:51:06,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55465 conditions, 21975 events. 16149/21975 cut-off events. For 8493/8493 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 114720 event pairs, 1334 based on Foata normal form. 40/22015 useless extension candidates. Maximal degree in co-relation 55453. Up to 12464 conditions per place. [2023-09-01 09:51:06,155 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 56 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2023-09-01 09:51:06,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 360 flow [2023-09-01 09:51:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:51:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:51:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-09-01 09:51:06,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051652892561983 [2023-09-01 09:51:06,158 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-09-01 09:51:06,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-09-01 09:51:06,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:06,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-09-01 09:51:06,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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) [2023-09-01 09:51:06,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-09-01 09:51:06,162 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-09-01 09:51:06,163 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 489 transitions. [2023-09-01 09:51:06,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 360 flow [2023-09-01 09:51:06,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:06,235 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 198 flow [2023-09-01 09:51:06,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-09-01 09:51:06,237 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-09-01 09:51:06,240 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 198 flow [2023-09-01 09:51:06,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-09-01 09:51:06,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:06,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:06,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:51:06,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:06,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash -766301092, now seen corresponding path program 1 times [2023-09-01 09:51:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390306824] [2023-09-01 09:51:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:06,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390306824] [2023-09-01 09:51:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390306824] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:06,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:06,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:51:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805430762] [2023-09-01 09:51:06,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:06,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:51:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:51:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:51:06,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-09-01 09:51:06,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-09-01 09:51:06,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:06,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-09-01 09:51:06,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:08,236 INFO L130 PetriNetUnfolder]: 15821/21537 cut-off events. [2023-09-01 09:51:08,236 INFO L131 PetriNetUnfolder]: For 17569/17569 co-relation queries the response was YES. [2023-09-01 09:51:08,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59029 conditions, 21537 events. 15821/21537 cut-off events. For 17569/17569 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 113299 event pairs, 3113 based on Foata normal form. 50/21587 useless extension candidates. Maximal degree in co-relation 59014. Up to 12454 conditions per place. [2023-09-01 09:51:08,388 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 67 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2023-09-01 09:51:08,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 524 flow [2023-09-01 09:51:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:51:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:51:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-09-01 09:51:08,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512396694214876 [2023-09-01 09:51:08,396 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-09-01 09:51:08,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-09-01 09:51:08,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:08,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-09-01 09:51:08,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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) [2023-09-01 09:51:08,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-09-01 09:51:08,401 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-09-01 09:51:08,401 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 198 flow. Second operand 4 states and 496 transitions. [2023-09-01 09:51:08,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 524 flow [2023-09-01 09:51:08,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:51:08,453 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 356 flow [2023-09-01 09:51:08,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-09-01 09:51:08,455 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-09-01 09:51:08,455 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 356 flow [2023-09-01 09:51:08,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-09-01 09:51:08,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:08,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:08,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:51:08,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:08,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2014464055, now seen corresponding path program 1 times [2023-09-01 09:51:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288206248] [2023-09-01 09:51:08,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:08,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288206248] [2023-09-01 09:51:08,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288206248] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:08,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:51:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979860774] [2023-09-01 09:51:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:08,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:51:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:51:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:51:08,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-09-01 09:51:08,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:08,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:08,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-09-01 09:51:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:10,236 INFO L130 PetriNetUnfolder]: 11814/16707 cut-off events. [2023-09-01 09:51:10,237 INFO L131 PetriNetUnfolder]: For 30380/31665 co-relation queries the response was YES. [2023-09-01 09:51:10,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48469 conditions, 16707 events. 11814/16707 cut-off events. For 30380/31665 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 94564 event pairs, 3764 based on Foata normal form. 529/16986 useless extension candidates. Maximal degree in co-relation 48449. Up to 11170 conditions per place. [2023-09-01 09:51:10,377 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 49 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-09-01 09:51:10,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 520 flow [2023-09-01 09:51:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:51:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:51:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-09-01 09:51:10,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261707988980716 [2023-09-01 09:51:10,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-09-01 09:51:10,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-09-01 09:51:10,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:10,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-09-01 09:51:10,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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) [2023-09-01 09:51:10,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:10,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:10,384 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 356 flow. Second operand 3 states and 382 transitions. [2023-09-01 09:51:10,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 520 flow [2023-09-01 09:51:10,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:51:10,413 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 370 flow [2023-09-01 09:51:10,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-09-01 09:51:10,415 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-09-01 09:51:10,416 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 370 flow [2023-09-01 09:51:10,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:10,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:10,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:10,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:51:10,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:10,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1612032770, now seen corresponding path program 1 times [2023-09-01 09:51:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:10,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597986028] [2023-09-01 09:51:10,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:10,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597986028] [2023-09-01 09:51:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597986028] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:10,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:51:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220106974] [2023-09-01 09:51:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:10,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:51:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:10,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:51:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:51:10,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-09-01 09:51:10,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-09-01 09:51:10,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:10,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-09-01 09:51:10,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:12,042 INFO L130 PetriNetUnfolder]: 10081/14725 cut-off events. [2023-09-01 09:51:12,042 INFO L131 PetriNetUnfolder]: For 30769/32043 co-relation queries the response was YES. [2023-09-01 09:51:12,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43752 conditions, 14725 events. 10081/14725 cut-off events. For 30769/32043 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 90072 event pairs, 1589 based on Foata normal form. 1539/16047 useless extension candidates. Maximal degree in co-relation 43729. Up to 8988 conditions per place. [2023-09-01 09:51:12,142 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 116 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2023-09-01 09:51:12,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 139 transitions, 1193 flow [2023-09-01 09:51:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:51:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:51:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-09-01 09:51:12,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-09-01 09:51:12,145 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-09-01 09:51:12,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-09-01 09:51:12,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:12,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-09-01 09:51:12,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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) [2023-09-01 09:51:12,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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) [2023-09-01 09:51:12,150 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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) [2023-09-01 09:51:12,150 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 370 flow. Second operand 5 states and 616 transitions. [2023-09-01 09:51:12,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 139 transitions, 1193 flow [2023-09-01 09:51:12,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 139 transitions, 1167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:12,181 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 437 flow [2023-09-01 09:51:12,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=437, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2023-09-01 09:51:12,182 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-09-01 09:51:12,182 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 437 flow [2023-09-01 09:51:12,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 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) [2023-09-01 09:51:12,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:12,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:12,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:51:12,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:12,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash 445096629, now seen corresponding path program 1 times [2023-09-01 09:51:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:12,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719688995] [2023-09-01 09:51:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:12,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:12,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719688995] [2023-09-01 09:51:12,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719688995] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:12,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:12,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:51:12,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811897061] [2023-09-01 09:51:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:12,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:51:12,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:12,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:51:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:51:12,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-09-01 09:51:12,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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) [2023-09-01 09:51:12,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:12,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-09-01 09:51:12,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:14,224 INFO L130 PetriNetUnfolder]: 15130/22137 cut-off events. [2023-09-01 09:51:14,225 INFO L131 PetriNetUnfolder]: For 51443/52031 co-relation queries the response was YES. [2023-09-01 09:51:14,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79811 conditions, 22137 events. 15130/22137 cut-off events. For 51443/52031 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 141494 event pairs, 7189 based on Foata normal form. 517/22365 useless extension candidates. Maximal degree in co-relation 79785. Up to 11385 conditions per place. [2023-09-01 09:51:14,323 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 70 selfloop transitions, 7 changer transitions 10/94 dead transitions. [2023-09-01 09:51:14,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 781 flow [2023-09-01 09:51:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:51:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:51:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-09-01 09:51:14,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371900826446281 [2023-09-01 09:51:14,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-09-01 09:51:14,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-09-01 09:51:14,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:14,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-09-01 09:51:14,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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) [2023-09-01 09:51:14,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:14,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-09-01 09:51:14,329 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 437 flow. Second operand 3 states and 390 transitions. [2023-09-01 09:51:14,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 781 flow [2023-09-01 09:51:14,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 772 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:51:14,404 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 423 flow [2023-09-01 09:51:14,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-09-01 09:51:14,405 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-09-01 09:51:14,405 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 423 flow [2023-09-01 09:51:14,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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) [2023-09-01 09:51:14,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:14,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:14,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:51:14,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:14,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1580943534, now seen corresponding path program 1 times [2023-09-01 09:51:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:14,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534457206] [2023-09-01 09:51:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534457206] [2023-09-01 09:51:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534457206] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:14,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:51:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677434385] [2023-09-01 09:51:14,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:14,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:51:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:14,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:51:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:51:14,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-09-01 09:51:14,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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) [2023-09-01 09:51:14,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:14,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-09-01 09:51:14,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:16,057 INFO L130 PetriNetUnfolder]: 10251/15512 cut-off events. [2023-09-01 09:51:16,057 INFO L131 PetriNetUnfolder]: For 35498/36468 co-relation queries the response was YES. [2023-09-01 09:51:16,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54862 conditions, 15512 events. 10251/15512 cut-off events. For 35498/36468 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 103015 event pairs, 1114 based on Foata normal form. 1398/16646 useless extension candidates. Maximal degree in co-relation 54835. Up to 5067 conditions per place. [2023-09-01 09:51:16,171 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 153 selfloop transitions, 17 changer transitions 1/182 dead transitions. [2023-09-01 09:51:16,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 182 transitions, 1639 flow [2023-09-01 09:51:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-09-01 09:51:16,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094451003541912 [2023-09-01 09:51:16,175 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-09-01 09:51:16,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-09-01 09:51:16,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:16,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-09-01 09:51:16,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 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) [2023-09-01 09:51:16,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-09-01 09:51:16,180 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-09-01 09:51:16,180 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 423 flow. Second operand 7 states and 863 transitions. [2023-09-01 09:51:16,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 182 transitions, 1639 flow [2023-09-01 09:51:16,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 182 transitions, 1547 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:16,318 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 525 flow [2023-09-01 09:51:16,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=525, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2023-09-01 09:51:16,319 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-09-01 09:51:16,319 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 525 flow [2023-09-01 09:51:16,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 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) [2023-09-01 09:51:16,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:16,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:16,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:51:16,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:16,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:16,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1557230208, now seen corresponding path program 1 times [2023-09-01 09:51:16,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:16,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968953807] [2023-09-01 09:51:16,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:16,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968953807] [2023-09-01 09:51:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968953807] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:16,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:16,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:16,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587237351] [2023-09-01 09:51:16,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:16,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:16,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:16,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:16,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-09-01 09:51:16,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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) [2023-09-01 09:51:16,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:16,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-09-01 09:51:16,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:18,281 INFO L130 PetriNetUnfolder]: 9591/14484 cut-off events. [2023-09-01 09:51:18,282 INFO L131 PetriNetUnfolder]: For 35839/36785 co-relation queries the response was YES. [2023-09-01 09:51:18,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58516 conditions, 14484 events. 9591/14484 cut-off events. For 35839/36785 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 95640 event pairs, 941 based on Foata normal form. 718/14928 useless extension candidates. Maximal degree in co-relation 58486. Up to 4825 conditions per place. [2023-09-01 09:51:18,402 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 169 selfloop transitions, 26 changer transitions 15/221 dead transitions. [2023-09-01 09:51:18,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 221 transitions, 1969 flow [2023-09-01 09:51:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:51:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:51:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1110 transitions. [2023-09-01 09:51:18,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509641873278237 [2023-09-01 09:51:18,407 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1110 transitions. [2023-09-01 09:51:18,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1110 transitions. [2023-09-01 09:51:18,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:18,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1110 transitions. [2023-09-01 09:51:18,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.33333333333333) internal successors, (1110), 9 states have internal predecessors, (1110), 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) [2023-09-01 09:51:18,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-09-01 09:51:18,415 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 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) [2023-09-01 09:51:18,415 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 525 flow. Second operand 9 states and 1110 transitions. [2023-09-01 09:51:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 221 transitions, 1969 flow [2023-09-01 09:51:19,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 221 transitions, 1921 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-09-01 09:51:19,687 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 651 flow [2023-09-01 09:51:19,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=651, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2023-09-01 09:51:19,688 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-09-01 09:51:19,688 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 651 flow [2023-09-01 09:51:19,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 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) [2023-09-01 09:51:19,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:19,689 INFO L208 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] [2023-09-01 09:51:19,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:51:19,689 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:19,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash -630083128, now seen corresponding path program 1 times [2023-09-01 09:51:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9104793] [2023-09-01 09:51:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:21,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:21,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9104793] [2023-09-01 09:51:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9104793] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:21,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 09:51:21,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897357542] [2023-09-01 09:51:21,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:21,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 09:51:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 09:51:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-09-01 09:51:21,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 242 [2023-09-01 09:51:21,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 651 flow. Second operand has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 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) [2023-09-01 09:51:21,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:21,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 242 [2023-09-01 09:51:21,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:24,476 INFO L130 PetriNetUnfolder]: 19150/28644 cut-off events. [2023-09-01 09:51:24,476 INFO L131 PetriNetUnfolder]: For 119381/119381 co-relation queries the response was YES. [2023-09-01 09:51:24,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126987 conditions, 28644 events. 19150/28644 cut-off events. For 119381/119381 co-relation queries the response was YES. Maximal size of possible extension queue 1162. Compared 193633 event pairs, 1673 based on Foata normal form. 11/28655 useless extension candidates. Maximal degree in co-relation 126954. Up to 6681 conditions per place. [2023-09-01 09:51:24,649 INFO L137 encePairwiseOnDemand]: 230/242 looper letters, 219 selfloop transitions, 65 changer transitions 136/420 dead transitions. [2023-09-01 09:51:24,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 420 transitions, 4438 flow [2023-09-01 09:51:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 09:51:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 09:51:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1315 transitions. [2023-09-01 09:51:24,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4939894815927874 [2023-09-01 09:51:24,653 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1315 transitions. [2023-09-01 09:51:24,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1315 transitions. [2023-09-01 09:51:24,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:24,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1315 transitions. [2023-09-01 09:51:24,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.54545454545455) internal successors, (1315), 11 states have internal predecessors, (1315), 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) [2023-09-01 09:51:24,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 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) [2023-09-01 09:51:24,662 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 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) [2023-09-01 09:51:24,662 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 651 flow. Second operand 11 states and 1315 transitions. [2023-09-01 09:51:24,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 420 transitions, 4438 flow [2023-09-01 09:51:27,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 420 transitions, 3689 flow, removed 274 selfloop flow, removed 4 redundant places. [2023-09-01 09:51:27,847 INFO L231 Difference]: Finished difference. Result has 86 places, 108 transitions, 1123 flow [2023-09-01 09:51:27,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1123, PETRI_PLACES=86, PETRI_TRANSITIONS=108} [2023-09-01 09:51:27,848 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-09-01 09:51:27,849 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 108 transitions, 1123 flow [2023-09-01 09:51:27,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 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) [2023-09-01 09:51:27,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:27,849 INFO L208 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] [2023-09-01 09:51:27,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:51:27,850 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:27,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1332257646, now seen corresponding path program 2 times [2023-09-01 09:51:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:27,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373709488] [2023-09-01 09:51:27,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:27,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:28,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373709488] [2023-09-01 09:51:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373709488] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:28,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:28,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:51:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148891727] [2023-09-01 09:51:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:28,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:28,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-09-01 09:51:28,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 108 transitions, 1123 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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) [2023-09-01 09:51:28,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:28,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-09-01 09:51:28,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:30,210 INFO L130 PetriNetUnfolder]: 8567/13992 cut-off events. [2023-09-01 09:51:30,210 INFO L131 PetriNetUnfolder]: For 48472/48932 co-relation queries the response was YES. [2023-09-01 09:51:30,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59905 conditions, 13992 events. 8567/13992 cut-off events. For 48472/48932 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 99206 event pairs, 2362 based on Foata normal form. 302/14174 useless extension candidates. Maximal degree in co-relation 59867. Up to 8081 conditions per place. [2023-09-01 09:51:30,323 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 139 selfloop transitions, 13 changer transitions 54/227 dead transitions. [2023-09-01 09:51:30,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 227 transitions, 2369 flow [2023-09-01 09:51:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-09-01 09:51:30,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112160566706021 [2023-09-01 09:51:30,325 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-09-01 09:51:30,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-09-01 09:51:30,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:30,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-09-01 09:51:30,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 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) [2023-09-01 09:51:30,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-09-01 09:51:30,330 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-09-01 09:51:30,331 INFO L175 Difference]: Start difference. First operand has 86 places, 108 transitions, 1123 flow. Second operand 7 states and 866 transitions. [2023-09-01 09:51:30,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 227 transitions, 2369 flow [2023-09-01 09:51:30,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 227 transitions, 2267 flow, removed 45 selfloop flow, removed 6 redundant places. [2023-09-01 09:51:30,795 INFO L231 Difference]: Finished difference. Result has 84 places, 116 transitions, 1177 flow [2023-09-01 09:51:30,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1177, PETRI_PLACES=84, PETRI_TRANSITIONS=116} [2023-09-01 09:51:30,796 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-09-01 09:51:30,796 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 116 transitions, 1177 flow [2023-09-01 09:51:30,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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) [2023-09-01 09:51:30,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:30,797 INFO L208 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] [2023-09-01 09:51:30,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:51:30,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:30,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1881503038, now seen corresponding path program 3 times [2023-09-01 09:51:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413785573] [2023-09-01 09:51:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413785573] [2023-09-01 09:51:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413785573] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:51:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119113174] [2023-09-01 09:51:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:31,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:51:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:51:31,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:51:31,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-09-01 09:51:31,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 116 transitions, 1177 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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) [2023-09-01 09:51:31,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:31,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-09-01 09:51:31,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:32,383 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][89], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 30#L876-3true, 164#true, 104#P0EXITtrue, 102#L852true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 209#(<= ~__unbuffered_cnt~0 2), 261#(<= ~__unbuffered_cnt~0 1), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 115#L813true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 195#(<= ~__unbuffered_cnt~0 1), Black: 179#(= ~__unbuffered_cnt~0 0), Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-09-01 09:51:32,383 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,383 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,383 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,383 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,390 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][89], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 30#L876-3true, 164#true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 84#P3EXITtrue, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 209#(<= ~__unbuffered_cnt~0 2), 261#(<= ~__unbuffered_cnt~0 1), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 115#L813true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 25#L773true, 195#(<= ~__unbuffered_cnt~0 1), Black: 179#(= ~__unbuffered_cnt~0 0), Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-09-01 09:51:32,390 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,390 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,390 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,390 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:51:32,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][159], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 30#L876-3true, 111#L793true, 262#(<= ~__unbuffered_cnt~0 2), 164#true, 104#P0EXITtrue, 102#L852true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 209#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-09-01 09:51:32,465 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,465 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,465 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,465 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][159], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 30#L876-3true, 262#(<= ~__unbuffered_cnt~0 2), 164#true, 104#P0EXITtrue, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 84#P3EXITtrue, P2Thread1of1ForFork0InUse, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 209#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), 115#L813true, Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-09-01 09:51:32,466 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,466 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,466 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,466 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,472 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][159], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 30#L876-3true, 111#L793true, 262#(<= ~__unbuffered_cnt~0 2), 164#true, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 84#P3EXITtrue, P2Thread1of1ForFork0InUse, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 209#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 25#L773true, Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-09-01 09:51:32,472 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,472 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,472 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,473 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:51:32,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][249], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 30#L876-3true, 111#L793true, 164#true, 104#P0EXITtrue, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, 84#P3EXITtrue, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 263#(<= ~__unbuffered_cnt~0 3), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), Black: 209#(<= ~__unbuffered_cnt~0 2), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), 205#true, Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-09-01 09:51:32,528 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-09-01 09:51:32,528 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-09-01 09:51:32,528 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-09-01 09:51:32,528 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-09-01 09:51:32,562 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~b$w_buff0_used~0_101 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_18 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_102 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_95 256))))) (.cse4 (and .cse2 .cse5))) (and (= v_~b~0_50 (ite .cse0 v_~b$w_buff0~0_34 (ite .cse1 v_~b$w_buff1~0_31 v_~b~0_51))) (= (ite (or (and .cse2 (not (= (mod v_~b$r_buff0_thd2~0_17 256) 0))) (and .cse3 (not (= 0 (mod v_~b$w_buff1_used~0_94 256))))) 0 v_~b$r_buff1_thd2~0_16) v_~b$r_buff1_thd2~0_15) (= (ite .cse0 0 v_~b$w_buff0_used~0_102) v_~b$w_buff0_used~0_101) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_18) v_~b$r_buff0_thd2~0_17) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_95) v_~b$w_buff1_used~0_94)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_102, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_95, ~b~0=v_~b~0_51, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_94, ~b~0=v_~b~0_50, ~b$w_buff1~0=v_~b$w_buff1~0_31, ~b$w_buff0~0=v_~b$w_buff0~0_34, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][271], [Black: 246#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= ~b$w_buff0~0 1)), Black: 252#(and (= ~b$r_buff0_thd4~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), 111#L793true, 164#true, 104#P0EXITtrue, Black: 200#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P2Thread1of1ForFork0InUse, 84#P3EXITtrue, Black: 195#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 225#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), 156#true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 245#(= ~b$r_buff0_thd4~0 0), 58#L3true, Black: 209#(<= ~__unbuffered_cnt~0 2), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 158#(= ~z~0 0), 205#true, Black: 167#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 266#(and (<= ~__unbuffered_cnt~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 174#(= ~__unbuffered_p3_EAX~0 0), Black: 235#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 224#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 233#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= ~b$w_buff1_used~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 179#(= ~__unbuffered_cnt~0 0), 64#P2EXITtrue, Black: 247#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 250#(and (= ~b$r_buff0_thd4~0 0) (< 0 (+ (div ~b$w_buff0_used~0 256) 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~b$r_buff1_thd4~0) (not (= ~b~0 0))), Black: 189#(= ~x~0 1)]) [2023-09-01 09:51:32,562 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-09-01 09:51:32,562 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 09:51:32,563 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 09:51:32,563 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 09:51:32,602 INFO L130 PetriNetUnfolder]: 7195/11475 cut-off events. [2023-09-01 09:51:32,602 INFO L131 PetriNetUnfolder]: For 45487/46130 co-relation queries the response was YES. [2023-09-01 09:51:32,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51765 conditions, 11475 events. 7195/11475 cut-off events. For 45487/46130 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 79271 event pairs, 766 based on Foata normal form. 566/11883 useless extension candidates. Maximal degree in co-relation 51727. Up to 4544 conditions per place. [2023-09-01 09:51:32,694 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 181 selfloop transitions, 18 changer transitions 84/299 dead transitions. [2023-09-01 09:51:32,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 299 transitions, 3527 flow [2023-09-01 09:51:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:51:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:51:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2023-09-01 09:51:32,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49586776859504134 [2023-09-01 09:51:32,698 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2023-09-01 09:51:32,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2023-09-01 09:51:32,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:32,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2023-09-01 09:51:32,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-09-01 09:51:32,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-09-01 09:51:32,704 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-09-01 09:51:32,704 INFO L175 Difference]: Start difference. First operand has 84 places, 116 transitions, 1177 flow. Second operand 8 states and 960 transitions. [2023-09-01 09:51:32,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 299 transitions, 3527 flow [2023-09-01 09:51:33,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 299 transitions, 3441 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-09-01 09:51:33,314 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 992 flow [2023-09-01 09:51:33,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=992, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2023-09-01 09:51:33,315 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2023-09-01 09:51:33,315 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 992 flow [2023-09-01 09:51:33,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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) [2023-09-01 09:51:33,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:33,316 INFO L208 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] [2023-09-01 09:51:33,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:51:33,317 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:33,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1350237375, now seen corresponding path program 1 times [2023-09-01 09:51:33,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:33,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969394826] [2023-09-01 09:51:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969394826] [2023-09-01 09:51:33,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969394826] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:33,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:33,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:33,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093031832] [2023-09-01 09:51:33,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:33,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:51:33,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:33,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:51:33,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:51:33,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 242 [2023-09-01 09:51:33,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 992 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 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) [2023-09-01 09:51:33,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:33,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 242 [2023-09-01 09:51:33,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:34,710 INFO L130 PetriNetUnfolder]: 4153/6418 cut-off events. [2023-09-01 09:51:34,710 INFO L131 PetriNetUnfolder]: For 30945/30945 co-relation queries the response was YES. [2023-09-01 09:51:34,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31851 conditions, 6418 events. 4153/6418 cut-off events. For 30945/30945 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 35389 event pairs, 400 based on Foata normal form. 2/6420 useless extension candidates. Maximal degree in co-relation 31812. Up to 3107 conditions per place. [2023-09-01 09:51:34,740 INFO L137 encePairwiseOnDemand]: 228/242 looper letters, 122 selfloop transitions, 98 changer transitions 97/317 dead transitions. [2023-09-01 09:51:34,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 317 transitions, 3435 flow [2023-09-01 09:51:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-01 09:51:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-09-01 09:51:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1677 transitions. [2023-09-01 09:51:34,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46198347107438015 [2023-09-01 09:51:34,745 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1677 transitions. [2023-09-01 09:51:34,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1677 transitions. [2023-09-01 09:51:34,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:34,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1677 transitions. [2023-09-01 09:51:34,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 111.8) internal successors, (1677), 15 states have internal predecessors, (1677), 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) [2023-09-01 09:51:34,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 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) [2023-09-01 09:51:34,755 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 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) [2023-09-01 09:51:34,755 INFO L175 Difference]: Start difference. First operand has 88 places, 99 transitions, 992 flow. Second operand 15 states and 1677 transitions. [2023-09-01 09:51:34,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 317 transitions, 3435 flow [2023-09-01 09:51:34,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 317 transitions, 3221 flow, removed 44 selfloop flow, removed 9 redundant places. [2023-09-01 09:51:34,875 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 1804 flow [2023-09-01 09:51:34,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1804, PETRI_PLACES=100, PETRI_TRANSITIONS=153} [2023-09-01 09:51:34,875 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2023-09-01 09:51:34,876 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 1804 flow [2023-09-01 09:51:34,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 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) [2023-09-01 09:51:34,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:34,876 INFO L208 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] [2023-09-01 09:51:34,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:51:34,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:34,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash 235005003, now seen corresponding path program 2 times [2023-09-01 09:51:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124341317] [2023-09-01 09:51:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124341317] [2023-09-01 09:51:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124341317] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:35,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:51:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234766006] [2023-09-01 09:51:35,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:35,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:51:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:35,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:51:35,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:51:35,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-09-01 09:51:35,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 1804 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-09-01 09:51:35,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:35,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-09-01 09:51:35,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:35,852 INFO L130 PetriNetUnfolder]: 3558/5708 cut-off events. [2023-09-01 09:51:35,853 INFO L131 PetriNetUnfolder]: For 29417/29417 co-relation queries the response was YES. [2023-09-01 09:51:35,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27955 conditions, 5708 events. 3558/5708 cut-off events. For 29417/29417 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 33061 event pairs, 1027 based on Foata normal form. 2/5710 useless extension candidates. Maximal degree in co-relation 27913. Up to 3006 conditions per place. [2023-09-01 09:51:35,885 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 120 selfloop transitions, 37 changer transitions 89/246 dead transitions. [2023-09-01 09:51:35,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 246 transitions, 3173 flow [2023-09-01 09:51:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:51:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:51:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-09-01 09:51:35,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506198347107438 [2023-09-01 09:51:35,887 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-09-01 09:51:35,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-09-01 09:51:35,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:35,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-09-01 09:51:35,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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) [2023-09-01 09:51:35,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-09-01 09:51:35,895 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-09-01 09:51:35,895 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 1804 flow. Second operand 4 states and 490 transitions. [2023-09-01 09:51:35,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 246 transitions, 3173 flow [2023-09-01 09:51:36,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 246 transitions, 3111 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:36,041 INFO L231 Difference]: Finished difference. Result has 100 places, 120 transitions, 1407 flow [2023-09-01 09:51:36,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1407, PETRI_PLACES=100, PETRI_TRANSITIONS=120} [2023-09-01 09:51:36,042 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2023-09-01 09:51:36,042 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 120 transitions, 1407 flow [2023-09-01 09:51:36,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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) [2023-09-01 09:51:36,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:36,043 INFO L208 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] [2023-09-01 09:51:36,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:51:36,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:36,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash -435288539, now seen corresponding path program 3 times [2023-09-01 09:51:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277915595] [2023-09-01 09:51:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:51:36,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:51:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:51:36,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:51:36,187 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:51:36,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:51:36,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:51:36,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:51:36,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:51:36,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:51:36,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:51:36,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:51:36,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:51:36,194 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:36,200 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:51:36,200 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:51:36,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:51:36 BasicIcfg [2023-09-01 09:51:36,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:51:36,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:51:36,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:51:36,304 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:51:36,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:50:55" (3/4) ... [2023-09-01 09:51:36,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:51:36,389 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:51:36,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:51:36,390 INFO L158 Benchmark]: Toolchain (without parser) took 42729.45ms. Allocated memory was 67.1MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 42.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2023-09-01 09:51:36,390 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 67.1MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:51:36,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.21ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 42.7MB in the beginning and 54.2MB in the end (delta: -11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:51:36,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.08ms. Allocated memory is still 86.0MB. Free memory was 54.2MB in the beginning and 51.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:51:36,391 INFO L158 Benchmark]: Boogie Preprocessor took 69.96ms. Allocated memory is still 86.0MB. Free memory was 51.8MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:51:36,391 INFO L158 Benchmark]: RCFGBuilder took 792.57ms. Allocated memory is still 86.0MB. Free memory was 49.6MB in the beginning and 57.8MB in the end (delta: -8.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-09-01 09:51:36,391 INFO L158 Benchmark]: TraceAbstraction took 41175.53ms. Allocated memory was 86.0MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 57.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-09-01 09:51:36,391 INFO L158 Benchmark]: Witness Printer took 85.26ms. Allocated memory is still 5.4GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:51:36,393 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 67.1MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.21ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 42.7MB in the beginning and 54.2MB in the end (delta: -11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.08ms. Allocated memory is still 86.0MB. Free memory was 54.2MB in the beginning and 51.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.96ms. Allocated memory is still 86.0MB. Free memory was 51.8MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 792.57ms. Allocated memory is still 86.0MB. Free memory was 49.6MB in the beginning and 57.8MB in the end (delta: -8.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 41175.53ms. Allocated memory was 86.0MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 57.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 85.26ms. Allocated memory is still 5.4GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3437, independent: 3217, independent conditional: 0, independent unconditional: 3217, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1767, independent: 1720, independent conditional: 0, independent unconditional: 1720, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3437, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 1767, unknown conditional: 0, unknown unconditional: 1767] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1161; [L870] FCALL, FORK 0 pthread_create(&t1161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1161, ((void *)0), P0, ((void *)0))=-3, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1162; [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t1162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1162, ((void *)0), P1, ((void *)0))=-2, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t1163; [L874] FCALL, FORK 0 pthread_create(&t1163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1163, ((void *)0), P2, ((void *)0))=-1, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t1164; [L876] FCALL, FORK 0 pthread_create(&t1164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1164, ((void *)0), P3, ((void *)0))=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L822] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: 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: 874]: 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: 876]: 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: 872]: 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: 870]: 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, 170 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: 40.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2371 IncrementalHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 71 mSDtfsCounter, 2371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1804occurred in iteration=13, InterpolantAutomatonStates: 86, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 1907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2023-09-01 09:51:36,421 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