/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/mix037_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:29:15,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:29:15,580 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:29:15,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:29:15,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:29:15,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:29:15,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:29:15,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:29:15,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:29:15,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:29:15,615 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:29:15,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:29:15,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:29:15,617 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:29:15,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:29:15,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:29:15,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:29:15,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:29:15,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:29:15,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:29:15,618 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:29:15,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:29:15,619 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:29:15,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:29:15,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:29:15,620 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:29:15,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:29:15,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:15,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:29:15,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:29:15,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:29:15,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:29:15,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:29:15,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:29:15,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:29:15,622 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:29:15,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:29:15,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:29:15,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:29:15,918 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:29:15,918 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:29:15,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:29:17,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:29:17,350 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:29:17,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:29:17,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b0c8b7f/133968e70389474a9bbf99df914f4fd3/FLAG17c55d590 [2023-08-24 05:29:17,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b0c8b7f/133968e70389474a9bbf99df914f4fd3 [2023-08-24 05:29:17,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:29:17,388 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:29:17,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:17,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:29:17,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:29:17,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:17,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3f12f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17, skipping insertion in model container [2023-08-24 05:29:17,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:17,429 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:29:17,582 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:29:17,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:17,825 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:29:17,836 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/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 05:29:17,857 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:17,859 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:17,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:17,944 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:17,944 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:17,950 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:29:17,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17 WrapperNode [2023-08-24 05:29:17,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:17,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:17,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:29:17,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:29:17,957 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:29:17" (1/1) ... [2023-08-24 05:29:17,988 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:29:17" (1/1) ... [2023-08-24 05:29:18,029 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-24 05:29:18,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:18,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:29:18,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:29:18,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:29:18,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:29:18,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:29:18,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:29:18,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:29:18,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (1/1) ... [2023-08-24 05:29:18,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:18,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:29:18,113 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:29:18,130 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:29:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:29:18,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:29:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:29:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:29:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:29:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:29:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:29:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:29:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:29:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:29:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:29:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:29:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:29:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:29:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:29:18,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:29:18,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:29:18,157 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:29:18,281 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:29:18,283 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:29:18,538 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:29:18,723 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:29:18,723 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:29:18,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:18 BoogieIcfgContainer [2023-08-24 05:29:18,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:29:18,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:29:18,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:29:18,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:29:18,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:29:17" (1/3) ... [2023-08-24 05:29:18,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124490d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:18, skipping insertion in model container [2023-08-24 05:29:18,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:17" (2/3) ... [2023-08-24 05:29:18,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124490d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:18, skipping insertion in model container [2023-08-24 05:29:18,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:18" (3/3) ... [2023-08-24 05:29:18,734 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:29:18,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:29:18,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:29:18,750 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:29:18,815 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:29:18,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-24 05:29:18,922 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-24 05:29:18,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:18,928 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 75 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:29:18,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-24 05:29:18,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-24 05:29:18,936 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:29:18,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-24 05:29:18,957 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-24 05:29:18,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-24 05:29:18,986 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-24 05:29:18,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:18,987 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 75 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:29:18,988 INFO L119 LiptonReduction]: Number of co-enabled transitions 3270 [2023-08-24 05:29:22,973 INFO L134 LiptonReduction]: Checked pairs total: 8894 [2023-08-24 05:29:22,973 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-24 05:29:22,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:29:22,990 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;@54f38b46, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:29:22,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:29:22,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:29:22,993 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:29:22,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:22,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:22,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:29:22,994 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:29:22,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash 553531, now seen corresponding path program 1 times [2023-08-24 05:29:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343188124] [2023-08-24 05:29:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:23,345 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:29:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:23,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343188124] [2023-08-24 05:29:23,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343188124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:23,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028359475] [2023-08-24 05:29:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:23,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:23,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:23,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-24 05:29:23,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 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:29:23,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:23,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-24 05:29:23,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:24,417 INFO L124 PetriNetUnfolderBase]: 5879/8109 cut-off events. [2023-08-24 05:29:24,417 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-24 05:29:24,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16253 conditions, 8109 events. 5879/8109 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 40514 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16241. Up to 6367 conditions per place. [2023-08-24 05:29:24,464 INFO L140 encePairwiseOnDemand]: 238/242 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-24 05:29:24,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-08-24 05:29:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-24 05:29:24,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523415977961432 [2023-08-24 05:29:24,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-24 05:29:24,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-24 05:29:24,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:24,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-24 05:29:24,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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:29:24,488 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:29:24,489 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:29:24,493 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 401 transitions. [2023-08-24 05:29:24,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-08-24 05:29:24,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:24,499 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-24 05:29:24,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-24 05:29:24,503 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-24 05:29:24,504 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-24 05:29:24,504 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:29:24,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:24,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:24,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:29:24,505 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:29:24,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash 276887586, now seen corresponding path program 1 times [2023-08-24 05:29:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111981189] [2023-08-24 05:29:24,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:24,745 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:29:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:24,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111981189] [2023-08-24 05:29:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111981189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:24,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898230254] [2023-08-24 05:29:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:24,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:24,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:29:24,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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:29:24,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:24,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:29:24,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:26,503 INFO L124 PetriNetUnfolderBase]: 14433/19638 cut-off events. [2023-08-24 05:29:26,503 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2023-08-24 05:29:26,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40412 conditions, 19638 events. 14433/19638 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 101916 event pairs, 5265 based on Foata normal form. 458/20096 useless extension candidates. Maximal degree in co-relation 40402. Up to 13647 conditions per place. [2023-08-24 05:29:26,609 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-24 05:29:26,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-08-24 05:29:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-24 05:29:26,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137741046831956 [2023-08-24 05:29:26,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-24 05:29:26,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-24 05:29:26,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:26,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-24 05:29:26,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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:29:26,618 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:29:26,619 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:29:26,619 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 373 transitions. [2023-08-24 05:29:26,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-08-24 05:29:26,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:26,622 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-08-24 05:29:26,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-24 05:29:26,625 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-24 05:29:26,626 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-08-24 05:29:26,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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:29:26,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:26,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:29:26,631 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:29:26,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash -6421663, now seen corresponding path program 1 times [2023-08-24 05:29:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752171473] [2023-08-24 05:29:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:26,831 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:29:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752171473] [2023-08-24 05:29:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752171473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:29:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514370320] [2023-08-24 05:29:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:26,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:26,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:26,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:29:26,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 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:29:26,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:26,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:29:26,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:28,391 INFO L124 PetriNetUnfolderBase]: 13351/18188 cut-off events. [2023-08-24 05:29:28,391 INFO L125 PetriNetUnfolderBase]: For 6666/6666 co-relation queries the response was YES. [2023-08-24 05:29:28,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 18188 events. 13351/18188 cut-off events. For 6666/6666 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 90109 event pairs, 3910 based on Foata normal form. 230/18418 useless extension candidates. Maximal degree in co-relation 44445. Up to 9003 conditions per place. [2023-08-24 05:29:28,478 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-08-24 05:29:28,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2023-08-24 05:29:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:29:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:29:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-08-24 05:29:28,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020661157024794 [2023-08-24 05:29:28,480 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-08-24 05:29:28,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-08-24 05:29:28,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:28,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-08-24 05:29:28,482 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:29:28,484 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:29:28,484 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:29:28,485 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 486 transitions. [2023-08-24 05:29:28,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2023-08-24 05:29:28,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:28,577 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 162 flow [2023-08-24 05:29:28,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-24 05:29:28,577 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-24 05:29:28,578 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 162 flow [2023-08-24 05:29:28,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 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:29:28,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:28,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:28,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:29:28,579 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:29:28,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -269327850, now seen corresponding path program 1 times [2023-08-24 05:29:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:28,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755380097] [2023-08-24 05:29:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:28,710 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:29:28,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:28,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755380097] [2023-08-24 05:29:28,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755380097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:28,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:28,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:29:28,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763743925] [2023-08-24 05:29:28,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:28,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2023-08-24 05:29:28,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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:29:28,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:28,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2023-08-24 05:29:28,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:29,993 INFO L124 PetriNetUnfolderBase]: 13076/17813 cut-off events. [2023-08-24 05:29:29,993 INFO L125 PetriNetUnfolderBase]: For 11334/11334 co-relation queries the response was YES. [2023-08-24 05:29:30,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46098 conditions, 17813 events. 13076/17813 cut-off events. For 11334/11334 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 91391 event pairs, 3313 based on Foata normal form. 40/17853 useless extension candidates. Maximal degree in co-relation 46083. Up to 11817 conditions per place. [2023-08-24 05:29:30,076 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 62 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2023-08-24 05:29:30,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 444 flow [2023-08-24 05:29:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:29:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:29:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-08-24 05:29:30,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144628099173554 [2023-08-24 05:29:30,083 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-08-24 05:29:30,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-08-24 05:29:30,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:30,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-08-24 05:29:30,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 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:29:30,086 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:29:30,087 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:29:30,087 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 162 flow. Second operand 4 states and 498 transitions. [2023-08-24 05:29:30,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 444 flow [2023-08-24 05:29:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:30,103 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 255 flow [2023-08-24 05:29:30,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-24 05:29:30,105 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-24 05:29:30,105 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 255 flow [2023-08-24 05:29:30,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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:29:30,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:30,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:30,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:29:30,106 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:29:30,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 240744825, now seen corresponding path program 1 times [2023-08-24 05:29:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:30,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477452233] [2023-08-24 05:29:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:30,244 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:29:30,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477452233] [2023-08-24 05:29:30,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477452233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:30,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:30,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:30,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97388449] [2023-08-24 05:29:30,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:30,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:30,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:29:30,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:30,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:30,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:29:30,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:31,566 INFO L124 PetriNetUnfolderBase]: 8950/12999 cut-off events. [2023-08-24 05:29:31,566 INFO L125 PetriNetUnfolderBase]: For 11130/11714 co-relation queries the response was YES. [2023-08-24 05:29:31,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34625 conditions, 12999 events. 8950/12999 cut-off events. For 11130/11714 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 77348 event pairs, 1594 based on Foata normal form. 1185/13832 useless extension candidates. Maximal degree in co-relation 34607. Up to 7989 conditions per place. [2023-08-24 05:29:31,619 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 88 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2023-08-24 05:29:31,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 750 flow [2023-08-24 05:29:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-08-24 05:29:31,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-08-24 05:29:31,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-08-24 05:29:31,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-08-24 05:29:31,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:31,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-08-24 05:29:31,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:31,626 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:29:31,627 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:29:31,627 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 255 flow. Second operand 5 states and 616 transitions. [2023-08-24 05:29:31,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 750 flow [2023-08-24 05:29:31,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 750 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:29:31,640 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 330 flow [2023-08-24 05:29:31,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2023-08-24 05:29:31,641 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-08-24 05:29:31,641 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 330 flow [2023-08-24 05:29:31,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:31,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:31,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:31,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:29:31,642 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:29:31,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1318392267, now seen corresponding path program 1 times [2023-08-24 05:29:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365475238] [2023-08-24 05:29:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:31,787 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:29:31,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:31,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365475238] [2023-08-24 05:29:31,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365475238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:29:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523259533] [2023-08-24 05:29:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:31,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:31,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-24 05:29:31,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:31,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:31,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-24 05:29:31,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:33,089 INFO L124 PetriNetUnfolderBase]: 12546/18330 cut-off events. [2023-08-24 05:29:33,089 INFO L125 PetriNetUnfolderBase]: For 26374/26446 co-relation queries the response was YES. [2023-08-24 05:29:33,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61099 conditions, 18330 events. 12546/18330 cut-off events. For 26374/26446 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 113446 event pairs, 5470 based on Foata normal form. 240/18159 useless extension candidates. Maximal degree in co-relation 61076. Up to 9915 conditions per place. [2023-08-24 05:29:33,194 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 60 selfloop transitions, 7 changer transitions 9/82 dead transitions. [2023-08-24 05:29:33,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 605 flow [2023-08-24 05:29:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-24 05:29:33,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371900826446281 [2023-08-24 05:29:33,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-24 05:29:33,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-24 05:29:33,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:33,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-24 05:29:33,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:33,199 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:29:33,200 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:29:33,200 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 330 flow. Second operand 3 states and 390 transitions. [2023-08-24 05:29:33,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 605 flow [2023-08-24 05:29:33,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:33,280 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 318 flow [2023-08-24 05:29:33,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-08-24 05:29:33,281 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-08-24 05:29:33,281 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 318 flow [2023-08-24 05:29:33,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:33,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:33,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:33,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:29:33,282 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:29:33,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -846353436, now seen corresponding path program 1 times [2023-08-24 05:29:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775117121] [2023-08-24 05:29:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:33,431 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:29:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775117121] [2023-08-24 05:29:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775117121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:33,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850719677] [2023-08-24 05:29:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:33,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:33,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:33,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:33,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:29:33,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:33,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:33,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:29:33,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:34,439 INFO L124 PetriNetUnfolderBase]: 7070/10753 cut-off events. [2023-08-24 05:29:34,440 INFO L125 PetriNetUnfolderBase]: For 14223/14450 co-relation queries the response was YES. [2023-08-24 05:29:34,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35200 conditions, 10753 events. 7070/10753 cut-off events. For 14223/14450 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 67621 event pairs, 922 based on Foata normal form. 831/11310 useless extension candidates. Maximal degree in co-relation 35176. Up to 3512 conditions per place. [2023-08-24 05:29:34,482 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 122 selfloop transitions, 17 changer transitions 0/149 dead transitions. [2023-08-24 05:29:34,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 149 transitions, 1160 flow [2023-08-24 05:29:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-08-24 05:29:34,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094451003541912 [2023-08-24 05:29:34,486 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-08-24 05:29:34,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-08-24 05:29:34,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:34,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-08-24 05:29:34,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:34,491 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:29:34,491 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:29:34,491 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 318 flow. Second operand 7 states and 863 transitions. [2023-08-24 05:29:34,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 149 transitions, 1160 flow [2023-08-24 05:29:34,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 149 transitions, 1126 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:34,544 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 437 flow [2023-08-24 05:29:34,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2023-08-24 05:29:34,545 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-24 05:29:34,545 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 437 flow [2023-08-24 05:29:34,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:34,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:34,546 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:29:34,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:29:34,546 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:29:34,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:34,547 INFO L85 PathProgramCache]: Analyzing trace with hash 524504820, now seen corresponding path program 1 times [2023-08-24 05:29:34,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:34,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976735823] [2023-08-24 05:29:34,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:34,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:34,771 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:29:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976735823] [2023-08-24 05:29:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976735823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:34,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774244504] [2023-08-24 05:29:34,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:29:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:29:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:29:34,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:29:34,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 437 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:34,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:34,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:29:34,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:35,815 INFO L124 PetriNetUnfolderBase]: 6533/9930 cut-off events. [2023-08-24 05:29:35,815 INFO L125 PetriNetUnfolderBase]: For 19385/19607 co-relation queries the response was YES. [2023-08-24 05:29:35,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37319 conditions, 9930 events. 6533/9930 cut-off events. For 19385/19607 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 62019 event pairs, 790 based on Foata normal form. 354/10017 useless extension candidates. Maximal degree in co-relation 37291. Up to 3329 conditions per place. [2023-08-24 05:29:35,854 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 134 selfloop transitions, 26 changer transitions 14/184 dead transitions. [2023-08-24 05:29:35,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 184 transitions, 1490 flow [2023-08-24 05:29:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:29:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:29:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1110 transitions. [2023-08-24 05:29:35,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509641873278237 [2023-08-24 05:29:35,859 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1110 transitions. [2023-08-24 05:29:35,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1110 transitions. [2023-08-24 05:29:35,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:35,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1110 transitions. [2023-08-24 05:29:35,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.33333333333333) internal successors, (1110), 9 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:35,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:35,866 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:35,866 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 437 flow. Second operand 9 states and 1110 transitions. [2023-08-24 05:29:35,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 184 transitions, 1490 flow [2023-08-24 05:29:36,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 184 transitions, 1428 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:36,292 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 555 flow [2023-08-24 05:29:36,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=555, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2023-08-24 05:29:36,293 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-08-24 05:29:36,293 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 555 flow [2023-08-24 05:29:36,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:36,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:36,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:36,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:29:36,297 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:29:36,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 769016745, now seen corresponding path program 1 times [2023-08-24 05:29:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:36,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103628628] [2023-08-24 05:29:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:37,112 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:29:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103628628] [2023-08-24 05:29:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103628628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:37,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371196488] [2023-08-24 05:29:37,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:37,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:29:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:29:37,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:29:37,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:29:37,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 555 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:37,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:37,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:29:37,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:38,995 INFO L124 PetriNetUnfolderBase]: 10077/15928 cut-off events. [2023-08-24 05:29:38,995 INFO L125 PetriNetUnfolderBase]: For 50895/51000 co-relation queries the response was YES. [2023-08-24 05:29:39,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64609 conditions, 15928 events. 10077/15928 cut-off events. For 50895/51000 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 113503 event pairs, 1450 based on Foata normal form. 75/15750 useless extension candidates. Maximal degree in co-relation 64579. Up to 5134 conditions per place. [2023-08-24 05:29:39,075 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 136 selfloop transitions, 7 changer transitions 79/232 dead transitions. [2023-08-24 05:29:39,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 232 transitions, 2411 flow [2023-08-24 05:29:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 845 transitions. [2023-08-24 05:29:39,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988193624557261 [2023-08-24 05:29:39,079 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 845 transitions. [2023-08-24 05:29:39,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 845 transitions. [2023-08-24 05:29:39,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:39,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 845 transitions. [2023-08-24 05:29:39,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 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:29:39,084 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:29:39,084 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:29:39,084 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 555 flow. Second operand 7 states and 845 transitions. [2023-08-24 05:29:39,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 232 transitions, 2411 flow [2023-08-24 05:29:40,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 232 transitions, 1972 flow, removed 162 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:40,682 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 529 flow [2023-08-24 05:29:40,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=529, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2023-08-24 05:29:40,683 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2023-08-24 05:29:40,683 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 529 flow [2023-08-24 05:29:40,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:40,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:40,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:40,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:29:40,684 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:29:40,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash -80776977, now seen corresponding path program 2 times [2023-08-24 05:29:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401743516] [2023-08-24 05:29:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:40,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:40,905 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:29:40,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401743516] [2023-08-24 05:29:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401743516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:40,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:29:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617103760] [2023-08-24 05:29:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:40,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:29:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:40,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:29:40,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:29:40,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-24 05:29:40,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 529 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:40,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:40,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-24 05:29:40,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:42,070 INFO L124 PetriNetUnfolderBase]: 7950/12481 cut-off events. [2023-08-24 05:29:42,071 INFO L125 PetriNetUnfolderBase]: For 26812/27131 co-relation queries the response was YES. [2023-08-24 05:29:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47302 conditions, 12481 events. 7950/12481 cut-off events. For 26812/27131 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 85332 event pairs, 754 based on Foata normal form. 245/12472 useless extension candidates. Maximal degree in co-relation 47273. Up to 2589 conditions per place. [2023-08-24 05:29:42,133 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 138 selfloop transitions, 31 changer transitions 29/206 dead transitions. [2023-08-24 05:29:42,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 206 transitions, 1704 flow [2023-08-24 05:29:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:29:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:29:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1327 transitions. [2023-08-24 05:29:42,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49849737039819686 [2023-08-24 05:29:42,137 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1327 transitions. [2023-08-24 05:29:42,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1327 transitions. [2023-08-24 05:29:42,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:42,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1327 transitions. [2023-08-24 05:29:42,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.63636363636364) internal successors, (1327), 11 states have internal predecessors, (1327), 0 states have call successors, (0), 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:29:42,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:42,143 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:42,143 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 529 flow. Second operand 11 states and 1327 transitions. [2023-08-24 05:29:42,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 206 transitions, 1704 flow [2023-08-24 05:29:42,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 206 transitions, 1682 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 05:29:42,974 INFO L231 Difference]: Finished difference. Result has 86 places, 68 transitions, 559 flow [2023-08-24 05:29:42,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=559, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2023-08-24 05:29:42,974 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-08-24 05:29:42,974 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 559 flow [2023-08-24 05:29:42,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:42,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:42,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:42,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:29:42,975 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:29:42,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1865585357, now seen corresponding path program 1 times [2023-08-24 05:29:42,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:42,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871327474] [2023-08-24 05:29:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:42,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:43,174 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:29:43,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871327474] [2023-08-24 05:29:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871327474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935485728] [2023-08-24 05:29:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:43,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:43,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242 [2023-08-24 05:29:43,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 559 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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:29:43,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:43,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242 [2023-08-24 05:29:43,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:44,185 INFO L124 PetriNetUnfolderBase]: 7242/11010 cut-off events. [2023-08-24 05:29:44,185 INFO L125 PetriNetUnfolderBase]: For 35969/35969 co-relation queries the response was YES. [2023-08-24 05:29:44,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47268 conditions, 11010 events. 7242/11010 cut-off events. For 35969/35969 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 66127 event pairs, 904 based on Foata normal form. 1/11011 useless extension candidates. Maximal degree in co-relation 47232. Up to 4798 conditions per place. [2023-08-24 05:29:44,235 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 88 selfloop transitions, 13 changer transitions 103/204 dead transitions. [2023-08-24 05:29:44,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 204 transitions, 2042 flow [2023-08-24 05:29:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:29:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:29:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-08-24 05:29:44,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.493801652892562 [2023-08-24 05:29:44,237 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-08-24 05:29:44,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-08-24 05:29:44,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:44,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-08-24 05:29:44,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 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:29:44,241 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:29:44,241 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:29:44,241 INFO L175 Difference]: Start difference. First operand has 86 places, 68 transitions, 559 flow. Second operand 6 states and 717 transitions. [2023-08-24 05:29:44,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 204 transitions, 2042 flow [2023-08-24 05:29:44,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 204 transitions, 1669 flow, removed 64 selfloop flow, removed 13 redundant places. [2023-08-24 05:29:44,599 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 364 flow [2023-08-24 05:29:44,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2023-08-24 05:29:44,599 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-08-24 05:29:44,600 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 364 flow [2023-08-24 05:29:44,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 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:29:44,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:44,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:44,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:29:44,600 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:29:44,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1998276989, now seen corresponding path program 2 times [2023-08-24 05:29:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929342791] [2023-08-24 05:29:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:44,818 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:29:44,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929342791] [2023-08-24 05:29:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929342791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:44,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:44,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993419226] [2023-08-24 05:29:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:44,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:44,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-24 05:29:44,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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:29:44,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:44,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-24 05:29:44,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:45,207 INFO L124 PetriNetUnfolderBase]: 2330/3655 cut-off events. [2023-08-24 05:29:45,207 INFO L125 PetriNetUnfolderBase]: For 8261/8311 co-relation queries the response was YES. [2023-08-24 05:29:45,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13079 conditions, 3655 events. 2330/3655 cut-off events. For 8261/8311 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19088 event pairs, 437 based on Foata normal form. 27/3677 useless extension candidates. Maximal degree in co-relation 13055. Up to 1907 conditions per place. [2023-08-24 05:29:45,218 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 47 selfloop transitions, 1 changer transitions 58/108 dead transitions. [2023-08-24 05:29:45,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 108 transitions, 866 flow [2023-08-24 05:29:45,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:29:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:29:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-24 05:29:45,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247933884297521 [2023-08-24 05:29:45,219 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-24 05:29:45,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-24 05:29:45,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:45,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-24 05:29:45,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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:29:45,221 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:29:45,221 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:29:45,222 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 364 flow. Second operand 4 states and 508 transitions. [2023-08-24 05:29:45,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 108 transitions, 866 flow [2023-08-24 05:29:45,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 822 flow, removed 22 selfloop flow, removed 7 redundant places. [2023-08-24 05:29:45,246 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 218 flow [2023-08-24 05:29:45,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2023-08-24 05:29:45,247 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-08-24 05:29:45,247 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 218 flow [2023-08-24 05:29:45,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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:29:45,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:45,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:45,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:29:45,248 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:29:45,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2013004327, now seen corresponding path program 3 times [2023-08-24 05:29:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232053902] [2023-08-24 05:29:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:46,120 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:29:46,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:46,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232053902] [2023-08-24 05:29:46,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232053902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:46,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:46,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:29:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279561016] [2023-08-24 05:29:46,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:46,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:29:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:46,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:29:46,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:29:46,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-24 05:29:46,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 42 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 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:29:46,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:46,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-24 05:29:46,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:46,493 INFO L124 PetriNetUnfolderBase]: 873/1438 cut-off events. [2023-08-24 05:29:46,494 INFO L125 PetriNetUnfolderBase]: For 2171/2187 co-relation queries the response was YES. [2023-08-24 05:29:46,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4981 conditions, 1438 events. 873/1438 cut-off events. For 2171/2187 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6623 event pairs, 207 based on Foata normal form. 14/1431 useless extension candidates. Maximal degree in co-relation 4964. Up to 940 conditions per place. [2023-08-24 05:29:46,500 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 51 selfloop transitions, 5 changer transitions 32/91 dead transitions. [2023-08-24 05:29:46,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 630 flow [2023-08-24 05:29:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-08-24 05:29:46,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722550177095632 [2023-08-24 05:29:46,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-08-24 05:29:46,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-08-24 05:29:46,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:46,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-08-24 05:29:46,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 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:29:46,506 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:29:46,507 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:29:46,507 INFO L175 Difference]: Start difference. First operand has 69 places, 42 transitions, 218 flow. Second operand 7 states and 800 transitions. [2023-08-24 05:29:46,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 630 flow [2023-08-24 05:29:46,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 597 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-08-24 05:29:46,516 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 212 flow [2023-08-24 05:29:46,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2023-08-24 05:29:46,517 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-24 05:29:46,518 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 212 flow [2023-08-24 05:29:46,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 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:29:46,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:46,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:46,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:29:46,519 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:29:46,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash -308892695, now seen corresponding path program 4 times [2023-08-24 05:29:46,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:46,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599768290] [2023-08-24 05:29:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:29:46,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:29:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:29:46,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:29:46,702 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:29:46,703 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:29:46,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:29:46,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:29:46,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:29:46,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:29:46,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:29:46,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:29:46,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:29:46,709 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:46,715 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:29:46,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:29:46,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:29:46 BasicIcfg [2023-08-24 05:29:46,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:29:46,815 INFO L158 Benchmark]: Toolchain (without parser) took 29427.85ms. Allocated memory was 369.1MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 344.1MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 827.5MB. Max. memory is 16.0GB. [2023-08-24 05:29:46,815 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 369.1MB. Free memory is still 345.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:29:46,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.29ms. Allocated memory is still 369.1MB. Free memory was 343.6MB in the beginning and 319.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:29:46,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.77ms. Allocated memory is still 369.1MB. Free memory was 319.5MB in the beginning and 316.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:29:46,816 INFO L158 Benchmark]: Boogie Preprocessor took 54.11ms. Allocated memory is still 369.1MB. Free memory was 316.9MB in the beginning and 315.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:29:46,816 INFO L158 Benchmark]: RCFGBuilder took 641.50ms. Allocated memory is still 369.1MB. Free memory was 314.8MB in the beginning and 332.2MB in the end (delta: -17.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.0GB. [2023-08-24 05:29:46,817 INFO L158 Benchmark]: TraceAbstraction took 28086.61ms. Allocated memory was 369.1MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 332.2MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 817.2MB. Max. memory is 16.0GB. [2023-08-24 05:29:46,818 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.11ms. Allocated memory is still 369.1MB. Free memory is still 345.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 562.29ms. Allocated memory is still 369.1MB. Free memory was 343.6MB in the beginning and 319.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.77ms. Allocated memory is still 369.1MB. Free memory was 319.5MB in the beginning and 316.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.11ms. Allocated memory is still 369.1MB. Free memory was 316.9MB in the beginning and 315.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 641.50ms. Allocated memory is still 369.1MB. Free memory was 314.8MB in the beginning and 332.2MB in the end (delta: -17.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.0GB. * TraceAbstraction took 28086.61ms. Allocated memory was 369.1MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 332.2MB in the beginning and 2.8GB in the end (delta: -2.5GB). Peak memory consumption was 817.2MB. 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.0s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 31 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 8894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3206, independent: 2964, independent conditional: 0, independent unconditional: 2964, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1743, independent: 1692, independent conditional: 0, independent unconditional: 1692, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3206, independent: 1272, independent conditional: 0, independent unconditional: 1272, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 1743, unknown conditional: 0, unknown unconditional: 1743] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$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 t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t969, ((void *)0), P0, ((void *)0))=-3, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t970, ((void *)0), P1, ((void *)0))=-2, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t971, ((void *)0), P2, ((void *)0))=-1, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t972, ((void *)0), P3, ((void *)0))=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [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 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={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 == 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=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: 27.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 619 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 619 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 20 mSDtfsCounter, 1694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred in iteration=10, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 1637 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:29:46,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...