/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:21:25,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:21:25,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:21:25,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:21:25,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:21:25,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:21:25,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:21:25,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:21:25,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:21:25,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:21:25,128 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:21:25,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:21:25,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:21:25,129 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:21:25,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:21:25,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:21:25,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:21:25,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:21:25,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:21:25,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:21:25,131 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:21:25,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:21:25,132 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:21:25,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:21:25,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:21:25,133 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:21:25,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:21:25,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:21:25,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:21:25,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:21:25,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:21:25,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:21:25,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:21:25,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:21:25,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:21:25,136 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:21:25,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:21:25,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:21:25,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:21:25,481 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:21:25,482 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:21:25,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:21:26,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:21:26,989 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:21:26,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:21:27,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a588efa5/fa3e0d877827491e975145fd881203b0/FLAG701a17bcb [2023-08-24 05:21:27,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a588efa5/fa3e0d877827491e975145fd881203b0 [2023-08-24 05:21:27,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:21:27,031 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:21:27,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:21:27,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:21:27,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:21:27,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67661201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27, skipping insertion in model container [2023-08-24 05:21:27,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,083 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:21:27,265 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:21:27,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:21:27,508 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:21:27,520 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:21:27,538 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:21:27,540 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:21:27,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:21:27,634 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:21:27,635 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:21:27,641 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:21:27,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27 WrapperNode [2023-08-24 05:21:27,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:21:27,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:21:27,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:21:27,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:21:27,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,715 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-24 05:21:27,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:21:27,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:21:27,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:21:27,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:21:27,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:21:27,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:21:27,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:21:27,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:21:27,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (1/1) ... [2023-08-24 05:21:27,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:21:27,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:21:27,789 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-08-24 05:21:27,799 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-08-24 05:21:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:21:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:21:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:21:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:21:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:21:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:21:27,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:21:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:21:27,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:21:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:21:27,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:21:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:21:27,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:21:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:21:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:21:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:21:27,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:21:27,827 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:21:27,969 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:21:27,970 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:21:28,301 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:21:28,420 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:21:28,420 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:21:28,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:21:28 BoogieIcfgContainer [2023-08-24 05:21:28,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:21:28,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:21:28,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:21:28,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:21:28,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:21:27" (1/3) ... [2023-08-24 05:21:28,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71244256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:21:28, skipping insertion in model container [2023-08-24 05:21:28,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:21:27" (2/3) ... [2023-08-24 05:21:28,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71244256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:21:28, skipping insertion in model container [2023-08-24 05:21:28,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:21:28" (3/3) ... [2023-08-24 05:21:28,432 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:21:28,449 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:21:28,449 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:21:28,449 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:21:28,512 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:21:28,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-24 05:21:28,591 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-24 05:21:28,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:21:28,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 05:21:28,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-24 05:21:28,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-24 05:21:28,603 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:21:28,611 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-24 05:21:28,614 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-24 05:21:28,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-24 05:21:28,642 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-24 05:21:28,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:21:28,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 05:21:28,645 INFO L119 LiptonReduction]: Number of co-enabled transitions 3286 [2023-08-24 05:21:32,795 INFO L134 LiptonReduction]: Checked pairs total: 9535 [2023-08-24 05:21:32,796 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-24 05:21:32,807 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:21:32,812 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=false, 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;@2fcde59e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:21:32,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:21:32,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:21:32,815 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:21:32,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:21:32,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:32,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:21:32,816 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-08-24 05:21:32,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 554491, now seen corresponding path program 1 times [2023-08-24 05:21:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:32,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530616698] [2023-08-24 05:21:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:33,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530616698] [2023-08-24 05:21:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530616698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:33,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:33,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:21:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304016946] [2023-08-24 05:21:33,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:33,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:21:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:33,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:21:33,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:21:33,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-24 05:21:33,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-08-24 05:21:33,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:33,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-24 05:21:33,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:34,199 INFO L124 PetriNetUnfolderBase]: 4903/6751 cut-off events. [2023-08-24 05:21:34,200 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-24 05:21:34,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13599 conditions, 6751 events. 4903/6751 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33758 event pairs, 2535 based on Foata normal form. 0/6404 useless extension candidates. Maximal degree in co-relation 13587. Up to 5335 conditions per place. [2023-08-24 05:21:34,250 INFO L140 encePairwiseOnDemand]: 238/242 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-24 05:21:34,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-08-24 05:21:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:21:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:21:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-24 05:21:34,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5495867768595041 [2023-08-24 05:21:34,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-24 05:21:34,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-24 05:21:34,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:34,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-24 05:21:34,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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-08-24 05:21:34,284 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-08-24 05:21:34,284 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-08-24 05:21:34,286 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 399 transitions. [2023-08-24 05:21:34,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-08-24 05:21:34,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:21:34,292 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-08-24 05:21:34,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-24 05:21:34,297 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-24 05:21:34,297 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-08-24 05:21:34,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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-08-24 05:21:34,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:34,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:34,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:21:34,298 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-08-24 05:21:34,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:34,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1210786638, now seen corresponding path program 1 times [2023-08-24 05:21:34,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:34,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218666834] [2023-08-24 05:21:34,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218666834] [2023-08-24 05:21:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218666834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:34,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:34,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:21:34,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669663661] [2023-08-24 05:21:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:34,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:21:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:34,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:21:34,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:21:34,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:21:34,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-08-24 05:21:34,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:34,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:21:34,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:36,813 INFO L124 PetriNetUnfolderBase]: 17555/23800 cut-off events. [2023-08-24 05:21:36,814 INFO L125 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2023-08-24 05:21:36,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48946 conditions, 23800 events. 17555/23800 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 125230 event pairs, 6475 based on Foata normal form. 548/24348 useless extension candidates. Maximal degree in co-relation 48936. Up to 16873 conditions per place. [2023-08-24 05:21:36,957 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-24 05:21:36,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2023-08-24 05:21:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:21:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:21:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-24 05:21:36,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082644628099173 [2023-08-24 05:21:36,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-24 05:21:36,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-24 05:21:36,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:36,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-24 05:21:36,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-08-24 05:21:36,963 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-08-24 05:21:36,963 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-08-24 05:21:36,964 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 369 transitions. [2023-08-24 05:21:36,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2023-08-24 05:21:36,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:21:36,967 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 128 flow [2023-08-24 05:21:36,968 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-24 05:21:36,971 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-08-24 05:21:36,971 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 128 flow [2023-08-24 05:21:36,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-08-24 05:21:36,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:36,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:36,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:21:36,978 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-08-24 05:21:36,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1120322243, now seen corresponding path program 1 times [2023-08-24 05:21:36,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241238666] [2023-08-24 05:21:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:37,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241238666] [2023-08-24 05:21:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241238666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:37,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:37,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:21:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616828383] [2023-08-24 05:21:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:21:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:37,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:21:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:21:37,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:21:37,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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-08-24 05:21:37,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:37,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:21:37,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:39,141 INFO L124 PetriNetUnfolderBase]: 16219/22016 cut-off events. [2023-08-24 05:21:39,141 INFO L125 PetriNetUnfolderBase]: For 8711/8711 co-relation queries the response was YES. [2023-08-24 05:21:39,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54766 conditions, 22016 events. 16219/22016 cut-off events. For 8711/8711 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 111143 event pairs, 4633 based on Foata normal form. 280/22296 useless extension candidates. Maximal degree in co-relation 54754. Up to 11079 conditions per place. [2023-08-24 05:21:39,235 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-24 05:21:39,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 348 flow [2023-08-24 05:21:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:21:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:21:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-24 05:21:39,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496900826446281 [2023-08-24 05:21:39,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-24 05:21:39,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-24 05:21:39,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:39,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-24 05:21:39,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 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-08-24 05:21:39,240 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-08-24 05:21:39,241 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-08-24 05:21:39,241 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 128 flow. Second operand 4 states and 481 transitions. [2023-08-24 05:21:39,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 348 flow [2023-08-24 05:21:39,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:21:39,301 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 180 flow [2023-08-24 05:21:39,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-24 05:21:39,302 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-24 05:21:39,305 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 180 flow [2023-08-24 05:21:39,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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-08-24 05:21:39,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:39,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:39,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:21:39,306 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-08-24 05:21:39,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash -409342910, now seen corresponding path program 1 times [2023-08-24 05:21:39,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:39,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952744717] [2023-08-24 05:21:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:39,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952744717] [2023-08-24 05:21:39,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952744717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:39,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:39,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:21:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161955667] [2023-08-24 05:21:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:39,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:21:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:39,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:21:39,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:21:39,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:21:39,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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-08-24 05:21:39,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:39,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:21:39,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:40,941 INFO L124 PetriNetUnfolderBase]: 15283/20760 cut-off events. [2023-08-24 05:21:40,941 INFO L125 PetriNetUnfolderBase]: For 14749/14749 co-relation queries the response was YES. [2023-08-24 05:21:40,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54711 conditions, 20760 events. 15283/20760 cut-off events. For 14749/14749 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 105997 event pairs, 4055 based on Foata normal form. 200/20960 useless extension candidates. Maximal degree in co-relation 54696. Up to 10893 conditions per place. [2023-08-24 05:21:41,036 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 64 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2023-08-24 05:21:41,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 468 flow [2023-08-24 05:21:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:21:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:21:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-08-24 05:21:41,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010330578512396 [2023-08-24 05:21:41,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-08-24 05:21:41,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-08-24 05:21:41,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:41,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-08-24 05:21:41,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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-08-24 05:21:41,042 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-08-24 05:21:41,043 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-08-24 05:21:41,043 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 180 flow. Second operand 4 states and 485 transitions. [2023-08-24 05:21:41,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 468 flow [2023-08-24 05:21:41,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:21:41,072 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 308 flow [2023-08-24 05:21:41,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-08-24 05:21:41,074 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-08-24 05:21:41,074 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 308 flow [2023-08-24 05:21:41,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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-08-24 05:21:41,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:41,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:41,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:21:41,075 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-08-24 05:21:41,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash -662438963, now seen corresponding path program 1 times [2023-08-24 05:21:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94694461] [2023-08-24 05:21:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94694461] [2023-08-24 05:21:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94694461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:21:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544213196] [2023-08-24 05:21:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:41,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:21:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:21:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:21:41,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:21:41,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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-08-24 05:21:41,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:41,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:21:41,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:42,833 INFO L124 PetriNetUnfolderBase]: 15067/20464 cut-off events. [2023-08-24 05:21:42,834 INFO L125 PetriNetUnfolderBase]: For 28953/28953 co-relation queries the response was YES. [2023-08-24 05:21:42,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59835 conditions, 20464 events. 15067/20464 cut-off events. For 28953/28953 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 105129 event pairs, 3829 based on Foata normal form. 32/20496 useless extension candidates. Maximal degree in co-relation 59816. Up to 13729 conditions per place. [2023-08-24 05:21:42,973 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 64 selfloop transitions, 27 changer transitions 0/91 dead transitions. [2023-08-24 05:21:42,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 648 flow [2023-08-24 05:21:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:21:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:21:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-08-24 05:21:42,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092975206611571 [2023-08-24 05:21:42,980 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-08-24 05:21:42,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-08-24 05:21:42,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:42,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-08-24 05:21:42,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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-08-24 05:21:42,989 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-08-24 05:21:42,990 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-08-24 05:21:42,990 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 308 flow. Second operand 4 states and 493 transitions. [2023-08-24 05:21:42,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 648 flow [2023-08-24 05:21:43,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:21:43,028 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 459 flow [2023-08-24 05:21:43,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2023-08-24 05:21:43,030 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-08-24 05:21:43,030 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 459 flow [2023-08-24 05:21:43,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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-08-24 05:21:43,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:43,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:43,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:21:43,031 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-08-24 05:21:43,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash 940141390, now seen corresponding path program 1 times [2023-08-24 05:21:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428390748] [2023-08-24 05:21:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428390748] [2023-08-24 05:21:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428390748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:43,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:21:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123967177] [2023-08-24 05:21:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:43,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:21:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:21:43,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:21:43,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-08-24 05:21:43,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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-08-24 05:21:43,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:43,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-08-24 05:21:43,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:44,621 INFO L124 PetriNetUnfolderBase]: 9504/14146 cut-off events. [2023-08-24 05:21:44,621 INFO L125 PetriNetUnfolderBase]: For 18239/19095 co-relation queries the response was YES. [2023-08-24 05:21:44,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38158 conditions, 14146 events. 9504/14146 cut-off events. For 18239/19095 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 91057 event pairs, 2003 based on Foata normal form. 1392/14870 useless extension candidates. Maximal degree in co-relation 38136. Up to 5601 conditions per place. [2023-08-24 05:21:44,720 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 73 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2023-08-24 05:21:44,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 103 transitions, 875 flow [2023-08-24 05:21:44,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:21:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:21:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-08-24 05:21:44,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515495867768595 [2023-08-24 05:21:44,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-08-24 05:21:44,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-08-24 05:21:44,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:44,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-08-24 05:21:44,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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-08-24 05:21:44,726 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-08-24 05:21:44,726 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-08-24 05:21:44,726 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 459 flow. Second operand 4 states and 499 transitions. [2023-08-24 05:21:44,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 103 transitions, 875 flow [2023-08-24 05:21:44,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 875 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:21:44,739 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 505 flow [2023-08-24 05:21:44,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2023-08-24 05:21:44,739 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2023-08-24 05:21:44,740 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 505 flow [2023-08-24 05:21:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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-08-24 05:21:44,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:44,740 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-08-24 05:21:44,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:21:44,740 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-08-24 05:21:44,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash -342545889, now seen corresponding path program 1 times [2023-08-24 05:21:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:44,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870778130] [2023-08-24 05:21:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870778130] [2023-08-24 05:21:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870778130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:44,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:44,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:21:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638688265] [2023-08-24 05:21:44,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:44,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:21:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:44,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:21:44,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:21:44,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-24 05:21:44,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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-08-24 05:21:44,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:44,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-24 05:21:44,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:46,597 INFO L124 PetriNetUnfolderBase]: 15401/22713 cut-off events. [2023-08-24 05:21:46,597 INFO L125 PetriNetUnfolderBase]: For 45736/47530 co-relation queries the response was YES. [2023-08-24 05:21:46,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78721 conditions, 22713 events. 15401/22713 cut-off events. For 45736/47530 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 151352 event pairs, 2769 based on Foata normal form. 697/22656 useless extension candidates. Maximal degree in co-relation 78695. Up to 11445 conditions per place. [2023-08-24 05:21:46,747 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 77 selfloop transitions, 3 changer transitions 17/112 dead transitions. [2023-08-24 05:21:46,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 991 flow [2023-08-24 05:21:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:21:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:21:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-24 05:21:46,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-08-24 05:21:46,749 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-24 05:21:46,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-24 05:21:46,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:46,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-24 05:21:46,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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-08-24 05:21:46,752 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-08-24 05:21:46,753 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-08-24 05:21:46,753 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 505 flow. Second operand 4 states and 506 transitions. [2023-08-24 05:21:46,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 991 flow [2023-08-24 05:21:46,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:21:46,825 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 513 flow [2023-08-24 05:21:46,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=513, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-24 05:21:46,826 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-08-24 05:21:46,826 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 513 flow [2023-08-24 05:21:46,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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-08-24 05:21:46,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:46,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:46,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:21:46,827 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-08-24 05:21:46,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2026511460, now seen corresponding path program 1 times [2023-08-24 05:21:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473792101] [2023-08-24 05:21:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473792101] [2023-08-24 05:21:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473792101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:47,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:47,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:21:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391588984] [2023-08-24 05:21:47,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:47,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:21:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:21:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:21:47,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-24 05:21:47,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 513 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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-08-24 05:21:47,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:47,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-24 05:21:47,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:49,949 INFO L124 PetriNetUnfolderBase]: 22764/33456 cut-off events. [2023-08-24 05:21:49,949 INFO L125 PetriNetUnfolderBase]: For 69607/71138 co-relation queries the response was YES. [2023-08-24 05:21:50,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114641 conditions, 33456 events. 22764/33456 cut-off events. For 69607/71138 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 229495 event pairs, 3923 based on Foata normal form. 832/33633 useless extension candidates. Maximal degree in co-relation 114613. Up to 17377 conditions per place. [2023-08-24 05:21:50,185 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 73 selfloop transitions, 3 changer transitions 13/106 dead transitions. [2023-08-24 05:21:50,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 106 transitions, 958 flow [2023-08-24 05:21:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:21:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:21:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-24 05:21:50,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175619834710744 [2023-08-24 05:21:50,187 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-24 05:21:50,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-24 05:21:50,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:50,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-24 05:21:50,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 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-08-24 05:21:50,191 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-08-24 05:21:50,191 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-08-24 05:21:50,191 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 513 flow. Second operand 4 states and 501 transitions. [2023-08-24 05:21:50,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 106 transitions, 958 flow [2023-08-24 05:21:50,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:21:50,292 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 533 flow [2023-08-24 05:21:50,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=533, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-24 05:21:50,293 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2023-08-24 05:21:50,293 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 533 flow [2023-08-24 05:21:50,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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-08-24 05:21:50,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:50,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:50,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:21:50,294 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-08-24 05:21:50,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:50,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1255214388, now seen corresponding path program 1 times [2023-08-24 05:21:50,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:50,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803087380] [2023-08-24 05:21:50,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:50,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803087380] [2023-08-24 05:21:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803087380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:50,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:21:50,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705301003] [2023-08-24 05:21:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:50,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:21:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:50,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:21:50,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:21:50,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:21:50,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 533 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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-08-24 05:21:50,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:50,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:21:50,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:54,940 INFO L124 PetriNetUnfolderBase]: 35703/51298 cut-off events. [2023-08-24 05:21:54,940 INFO L125 PetriNetUnfolderBase]: For 134339/134339 co-relation queries the response was YES. [2023-08-24 05:21:55,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184562 conditions, 51298 events. 35703/51298 cut-off events. For 134339/134339 co-relation queries the response was YES. Maximal size of possible extension queue 1884. Compared 341688 event pairs, 14381 based on Foata normal form. 168/51466 useless extension candidates. Maximal degree in co-relation 184532. Up to 28617 conditions per place. [2023-08-24 05:21:55,161 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 76 selfloop transitions, 14 changer transitions 10/100 dead transitions. [2023-08-24 05:21:55,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 895 flow [2023-08-24 05:21:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:21:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:21:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-08-24 05:21:55,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020661157024794 [2023-08-24 05:21:55,163 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-08-24 05:21:55,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-08-24 05:21:55,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:55,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-08-24 05:21:55,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 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-08-24 05:21:55,167 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-08-24 05:21:55,167 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-08-24 05:21:55,167 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 533 flow. Second operand 4 states and 486 transitions. [2023-08-24 05:21:55,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 895 flow [2023-08-24 05:21:55,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 892 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:21:55,459 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 503 flow [2023-08-24 05:21:55,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-24 05:21:55,460 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-08-24 05:21:55,460 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 503 flow [2023-08-24 05:21:55,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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-08-24 05:21:55,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:55,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:21:55,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:21:55,461 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-08-24 05:21:55,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash 441610742, now seen corresponding path program 1 times [2023-08-24 05:21:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841304128] [2023-08-24 05:21:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841304128] [2023-08-24 05:21:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841304128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:55,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:21:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906527868] [2023-08-24 05:21:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:55,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:21:55,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:55,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:21:55,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:21:55,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-08-24 05:21:55,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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-08-24 05:21:55,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:55,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-08-24 05:21:55,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:57,565 INFO L124 PetriNetUnfolderBase]: 11844/18660 cut-off events. [2023-08-24 05:21:57,565 INFO L125 PetriNetUnfolderBase]: For 29918/30584 co-relation queries the response was YES. [2023-08-24 05:21:57,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59098 conditions, 18660 events. 11844/18660 cut-off events. For 29918/30584 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 135444 event pairs, 1553 based on Foata normal form. 2073/20273 useless extension candidates. Maximal degree in co-relation 59066. Up to 6617 conditions per place. [2023-08-24 05:21:57,639 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 89 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2023-08-24 05:21:57,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 1103 flow [2023-08-24 05:21:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:21:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:21:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-24 05:21:57,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173553719008265 [2023-08-24 05:21:57,641 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-24 05:21:57,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-24 05:21:57,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:57,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-24 05:21:57,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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-08-24 05:21:57,645 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-08-24 05:21:57,646 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-08-24 05:21:57,646 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 503 flow. Second operand 5 states and 626 transitions. [2023-08-24 05:21:57,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 1103 flow [2023-08-24 05:21:57,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 119 transitions, 1006 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 05:21:57,666 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 507 flow [2023-08-24 05:21:57,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-08-24 05:21:57,667 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-08-24 05:21:57,667 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 507 flow [2023-08-24 05:21:57,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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-08-24 05:21:57,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:57,667 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] [2023-08-24 05:21:57,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:21:57,668 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-08-24 05:21:57,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -807514493, now seen corresponding path program 1 times [2023-08-24 05:21:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611908819] [2023-08-24 05:21:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:21:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:21:57,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:21:57,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611908819] [2023-08-24 05:21:57,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611908819] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:21:57,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:21:57,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:21:57,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516444379] [2023-08-24 05:21:57,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:21:57,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:21:57,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:21:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:21:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:21:57,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-08-24 05:21:57,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-08-24 05:21:57,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:21:57,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-08-24 05:21:57,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:21:59,686 INFO L124 PetriNetUnfolderBase]: 10464/16637 cut-off events. [2023-08-24 05:21:59,686 INFO L125 PetriNetUnfolderBase]: For 30292/30839 co-relation queries the response was YES. [2023-08-24 05:21:59,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59391 conditions, 16637 events. 10464/16637 cut-off events. For 30292/30839 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 120112 event pairs, 1399 based on Foata normal form. 944/17179 useless extension candidates. Maximal degree in co-relation 59358. Up to 6556 conditions per place. [2023-08-24 05:21:59,748 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 95 selfloop transitions, 14 changer transitions 6/134 dead transitions. [2023-08-24 05:21:59,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 134 transitions, 1150 flow [2023-08-24 05:21:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:21:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:21:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-08-24 05:21:59,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179063360881543 [2023-08-24 05:21:59,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-08-24 05:21:59,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-08-24 05:21:59,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:21:59,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-08-24 05:21:59,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 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-08-24 05:21:59,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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-08-24 05:21:59,755 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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-08-24 05:21:59,755 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 507 flow. Second operand 6 states and 752 transitions. [2023-08-24 05:21:59,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 134 transitions, 1150 flow [2023-08-24 05:21:59,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 134 transitions, 1123 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-24 05:21:59,780 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 544 flow [2023-08-24 05:21:59,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2023-08-24 05:21:59,781 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-08-24 05:21:59,781 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 544 flow [2023-08-24 05:21:59,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-08-24 05:21:59,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:21:59,782 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] [2023-08-24 05:21:59,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:21:59,782 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-08-24 05:21:59,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:21:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash -306010765, now seen corresponding path program 1 times [2023-08-24 05:21:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:21:59,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138153547] [2023-08-24 05:21:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:21:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:21:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:22:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:22:00,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:22:00,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138153547] [2023-08-24 05:22:00,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138153547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:22:00,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:22:00,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:22:00,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885887550] [2023-08-24 05:22:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:22:00,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:22:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:22:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:22:00,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:22:00,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-08-24 05:22:00,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 544 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-08-24 05:22:00,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:22:00,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-08-24 05:22:00,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:22:01,634 INFO L124 PetriNetUnfolderBase]: 9970/15914 cut-off events. [2023-08-24 05:22:01,634 INFO L125 PetriNetUnfolderBase]: For 39466/39993 co-relation queries the response was YES. [2023-08-24 05:22:01,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60366 conditions, 15914 events. 9970/15914 cut-off events. For 39466/39993 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 115434 event pairs, 1382 based on Foata normal form. 347/15887 useless extension candidates. Maximal degree in co-relation 60332. Up to 6370 conditions per place. [2023-08-24 05:22:01,690 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 51 selfloop transitions, 18 changer transitions 42/116 dead transitions. [2023-08-24 05:22:01,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 1035 flow [2023-08-24 05:22:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:22:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:22:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-24 05:22:01,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017709563164109 [2023-08-24 05:22:01,692 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-24 05:22:01,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-24 05:22:01,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:22:01,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-24 05:22:01,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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-08-24 05:22:01,697 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-08-24 05:22:01,697 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-08-24 05:22:01,697 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 544 flow. Second operand 7 states and 850 transitions. [2023-08-24 05:22:01,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 1035 flow [2023-08-24 05:22:02,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 116 transitions, 989 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-24 05:22:02,210 INFO L231 Difference]: Finished difference. Result has 81 places, 41 transitions, 298 flow [2023-08-24 05:22:02,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=81, PETRI_TRANSITIONS=41} [2023-08-24 05:22:02,210 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-08-24 05:22:02,211 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 41 transitions, 298 flow [2023-08-24 05:22:02,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-08-24 05:22:02,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:22:02,211 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, 1] [2023-08-24 05:22:02,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:22:02,211 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-08-24 05:22:02,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:22:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 37248146, now seen corresponding path program 1 times [2023-08-24 05:22:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:22:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223741640] [2023-08-24 05:22:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:22:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:22:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:22:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:22:03,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:22:03,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223741640] [2023-08-24 05:22:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223741640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:22:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:22:03,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:22:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078702136] [2023-08-24 05:22:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:22:03,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:22:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:22:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:22:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:22:03,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-24 05:22:03,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 41 transitions, 298 flow. Second operand has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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-08-24 05:22:03,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:22:03,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-24 05:22:03,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:22:03,389 INFO L124 PetriNetUnfolderBase]: 972/1635 cut-off events. [2023-08-24 05:22:03,390 INFO L125 PetriNetUnfolderBase]: For 3584/3650 co-relation queries the response was YES. [2023-08-24 05:22:03,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6293 conditions, 1635 events. 972/1635 cut-off events. For 3584/3650 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8400 event pairs, 106 based on Foata normal form. 1/1597 useless extension candidates. Maximal degree in co-relation 6265. Up to 879 conditions per place. [2023-08-24 05:22:03,398 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 50 selfloop transitions, 4 changer transitions 34/93 dead transitions. [2023-08-24 05:22:03,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 828 flow [2023-08-24 05:22:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:22:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:22:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2023-08-24 05:22:03,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47284533648170013 [2023-08-24 05:22:03,400 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2023-08-24 05:22:03,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2023-08-24 05:22:03,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:22:03,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2023-08-24 05:22:03,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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-08-24 05:22:03,404 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-08-24 05:22:03,405 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-08-24 05:22:03,405 INFO L175 Difference]: Start difference. First operand has 81 places, 41 transitions, 298 flow. Second operand 7 states and 801 transitions. [2023-08-24 05:22:03,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 828 flow [2023-08-24 05:22:03,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 498 flow, removed 46 selfloop flow, removed 29 redundant places. [2023-08-24 05:22:03,423 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 158 flow [2023-08-24 05:22:03,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-24 05:22:03,424 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-08-24 05:22:03,424 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 158 flow [2023-08-24 05:22:03,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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-08-24 05:22:03,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:22:03,425 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, 1] [2023-08-24 05:22:03,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:22:03,425 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-08-24 05:22:03,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:22:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1407122390, now seen corresponding path program 2 times [2023-08-24 05:22:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:22:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342591571] [2023-08-24 05:22:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:22:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:22:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:22:03,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:22:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:22:03,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:22:03,637 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:22:03,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:22:03,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:22:03,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:22:03,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:22:03,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:22:03,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:22:03,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:22:03,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:22:03,643 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:22:03,649 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:22:03,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:22:03,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:22:03 BasicIcfg [2023-08-24 05:22:03,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:22:03,753 INFO L158 Benchmark]: Toolchain (without parser) took 36722.35ms. Allocated memory was 392.2MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 348.2MB in the beginning and 6.0GB in the end (delta: -5.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-24 05:22:03,753 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 392.2MB. Free memory was 370.1MB in the beginning and 370.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:22:03,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.49ms. Allocated memory is still 392.2MB. Free memory was 348.2MB in the beginning and 324.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:22:03,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.57ms. Allocated memory is still 392.2MB. Free memory was 324.1MB in the beginning and 322.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:22:03,754 INFO L158 Benchmark]: Boogie Preprocessor took 38.06ms. Allocated memory is still 392.2MB. Free memory was 322.0MB in the beginning and 319.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:22:03,754 INFO L158 Benchmark]: RCFGBuilder took 668.18ms. Allocated memory is still 392.2MB. Free memory was 319.9MB in the beginning and 279.0MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-24 05:22:03,754 INFO L158 Benchmark]: TraceAbstraction took 35326.73ms. Allocated memory was 392.2MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 277.9MB in the beginning and 6.0GB in the end (delta: -5.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-24 05:22:03,755 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 392.2MB. Free memory was 370.1MB in the beginning and 370.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 610.49ms. Allocated memory is still 392.2MB. Free memory was 348.2MB in the beginning and 324.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.57ms. Allocated memory is still 392.2MB. Free memory was 324.1MB in the beginning and 322.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.06ms. Allocated memory is still 392.2MB. Free memory was 322.0MB in the beginning and 319.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 668.18ms. Allocated memory is still 392.2MB. Free memory was 319.9MB in the beginning and 279.0MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 35326.73ms. Allocated memory was 392.2MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 277.9MB in the beginning and 6.0GB in the end (delta: -5.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 140 PlacesBefore, 44 PlacesAfterwards, 129 TransitionsBefore, 32 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 9535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3972, independent: 3718, independent conditional: 0, independent unconditional: 3718, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1768, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3972, independent: 1997, independent conditional: 0, independent unconditional: 1997, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 1768, unknown conditional: 0, unknown unconditional: 1768] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t121, ((void *)0), P0, ((void *)0))=-1, t121={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t122, ((void *)0), P1, ((void *)0))=0, t121={5:0}, t122={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t123, ((void *)0), P2, ((void *)0))=1, t121={5:0}, t122={6:0}, t123={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t124, ((void *)0), P3, ((void *)0))=2, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - 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: 878]: 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, 171 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: 35.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 35 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=11, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-08-24 05:22:03,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...