/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/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:31:43,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:31:43,738 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:31:43,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:31:43,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:31:43,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:31:43,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:31:43,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:31:43,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:31:43,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:31:43,784 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:31:43,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:31:43,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:31:43,786 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:31:43,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:31:43,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:31:43,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:31:43,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:31:43,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:31:43,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:31:43,788 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:31:43,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:31:43,789 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:31:43,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:31:43,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:31:43,790 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:31:43,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:31:43,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:31:43,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:31:43,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:31:43,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:31:43,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:31:43,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:31:43,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:31:43,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:31:43,793 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:31:44,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:31:44,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:31:44,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:31:44,146 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:31:44,147 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:31:44,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-24 05:31:45,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:31:45,602 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:31:45,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-24 05:31:45,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa583b99c/81a1358c676b493894906a29ba4d936e/FLAGb0fe80ffd [2023-08-24 05:31:45,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa583b99c/81a1358c676b493894906a29ba4d936e [2023-08-24 05:31:45,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:31:45,656 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:31:45,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:31:45,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:31:45,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:31:45,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:31:45" (1/1) ... [2023-08-24 05:31:45,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176737b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:45, skipping insertion in model container [2023-08-24 05:31:45,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:31:45" (1/1) ... [2023-08-24 05:31:45,716 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:31:45,869 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/mix055_tso.oepc.i[949,962] [2023-08-24 05:31:46,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:31:46,057 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:31:46,067 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/mix055_tso.oepc.i[949,962] [2023-08-24 05:31:46,076 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:31:46,077 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:31:46,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:31:46,141 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:31:46,142 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:31:46,147 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:31:46,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46 WrapperNode [2023-08-24 05:31:46,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:31:46,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:31:46,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:31:46,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:31:46,154 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:31:46" (1/1) ... [2023-08-24 05:31:46,182 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:31:46" (1/1) ... [2023-08-24 05:31:46,206 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-24 05:31:46,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:31:46,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:31:46,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:31:46,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:31:46,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:31:46,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:31:46,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:31:46,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:31:46,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (1/1) ... [2023-08-24 05:31:46,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:31:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:31:46,272 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:31:46,311 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:31:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:31:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:31:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:31:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:31:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:31:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:31:46,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:31:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:31:46,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:31:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:31:46,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:31:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:31:46,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:31:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:31:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:31:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:31:46,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:31:46,326 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:31:46,482 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:31:46,483 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:31:46,921 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:31:47,044 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:31:47,044 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:31:47,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:31:47 BoogieIcfgContainer [2023-08-24 05:31:47,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:31:47,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:31:47,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:31:47,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:31:47,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:31:45" (1/3) ... [2023-08-24 05:31:47,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e1213e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:31:47, skipping insertion in model container [2023-08-24 05:31:47,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:46" (2/3) ... [2023-08-24 05:31:47,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e1213e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:31:47, skipping insertion in model container [2023-08-24 05:31:47,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:31:47" (3/3) ... [2023-08-24 05:31:47,053 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-08-24 05:31:47,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:31:47,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:31:47,069 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:31:47,114 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:31:47,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 05:31:47,209 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 05:31:47,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:47,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 05:31:47,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 05:31:47,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-08-24 05:31:47,225 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:31:47,240 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 05:31:47,246 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 05:31:47,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-08-24 05:31:47,292 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 05:31:47,293 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:47,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 05:31:47,297 INFO L119 LiptonReduction]: Number of co-enabled transitions 3044 [2023-08-24 05:31:51,290 INFO L134 LiptonReduction]: Checked pairs total: 8921 [2023-08-24 05:31:51,290 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-24 05:31:51,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:31:51,320 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;@1112aaaf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:31:51,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:31:51,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:31:51,331 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-24 05:31:51,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:51,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:51,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:31:51,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:31:51,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash 517905549, now seen corresponding path program 1 times [2023-08-24 05:31:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818586923] [2023-08-24 05:31:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:51,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:51,759 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:31:51,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:51,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818586923] [2023-08-24 05:31:51,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818586923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:51,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:51,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:31:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519403954] [2023-08-24 05:31:51,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:51,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:31:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:31:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:31:51,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 233 [2023-08-24 05:31:51,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:31:51,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:51,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 233 [2023-08-24 05:31:51,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:52,883 INFO L124 PetriNetUnfolderBase]: 5463/7958 cut-off events. [2023-08-24 05:31:52,883 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-24 05:31:52,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 7958 events. 5463/7958 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 47267 event pairs, 1005 based on Foata normal form. 256/7685 useless extension candidates. Maximal degree in co-relation 15546. Up to 5923 conditions per place. [2023-08-24 05:31:52,934 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-08-24 05:31:52,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2023-08-24 05:31:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:31:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:31:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-24 05:31:52,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493562231759657 [2023-08-24 05:31:52,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-24 05:31:52,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-24 05:31:52,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:52,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-24 05:31:52,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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:31:52,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 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:31:52,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 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:31:52,960 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 384 transitions. [2023-08-24 05:31:52,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2023-08-24 05:31:52,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:31:52,966 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-24 05:31:52,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-24 05:31:52,971 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-24 05:31:52,971 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-24 05:31:52,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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:31:52,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:52,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:52,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:31:52,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:31:52,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1725633849, now seen corresponding path program 1 times [2023-08-24 05:31:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802155979] [2023-08-24 05:31:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:53,458 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:31:53,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:53,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802155979] [2023-08-24 05:31:53,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802155979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:53,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:53,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:31:53,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647762018] [2023-08-24 05:31:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:53,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:31:53,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:31:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:31:53,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 05:31:53,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 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:31:53,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:53,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 05:31:53,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:55,471 INFO L124 PetriNetUnfolderBase]: 13353/18049 cut-off events. [2023-08-24 05:31:55,472 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2023-08-24 05:31:55,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37383 conditions, 18049 events. 13353/18049 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 88558 event pairs, 2064 based on Foata normal form. 747/18796 useless extension candidates. Maximal degree in co-relation 37373. Up to 13062 conditions per place. [2023-08-24 05:31:55,576 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 48 selfloop transitions, 13 changer transitions 42/103 dead transitions. [2023-08-24 05:31:55,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 103 transitions, 438 flow [2023-08-24 05:31:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:31:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:31:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2023-08-24 05:31:55,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47700797057020233 [2023-08-24 05:31:55,583 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 778 transitions. [2023-08-24 05:31:55,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions. [2023-08-24 05:31:55,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:55,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions. [2023-08-24 05:31:55,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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:31:55,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:31:55,593 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:31:55,594 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 7 states and 778 transitions. [2023-08-24 05:31:55,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 103 transitions, 438 flow [2023-08-24 05:31:55,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 103 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:55,600 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 168 flow [2023-08-24 05:31:55,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-24 05:31:55,604 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-08-24 05:31:55,604 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 168 flow [2023-08-24 05:31:55,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 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:31:55,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:55,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:31:55,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:31:55,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1955012510, now seen corresponding path program 1 times [2023-08-24 05:31:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144022534] [2023-08-24 05:31:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:56,161 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:31:56,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:56,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144022534] [2023-08-24 05:31:56,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144022534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:56,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:31:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429656135] [2023-08-24 05:31:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:56,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:31:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:31:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:31:56,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-24 05:31:56,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 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:31:56,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:56,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-24 05:31:56,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:57,856 INFO L124 PetriNetUnfolderBase]: 12988/17609 cut-off events. [2023-08-24 05:31:57,856 INFO L125 PetriNetUnfolderBase]: For 15527/15527 co-relation queries the response was YES. [2023-08-24 05:31:57,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55394 conditions, 17609 events. 12988/17609 cut-off events. For 15527/15527 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 87313 event pairs, 4667 based on Foata normal form. 680/18289 useless extension candidates. Maximal degree in co-relation 55379. Up to 15129 conditions per place. [2023-08-24 05:31:57,980 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 66 selfloop transitions, 23 changer transitions 51/140 dead transitions. [2023-08-24 05:31:57,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 140 transitions, 900 flow [2023-08-24 05:31:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:31:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:31:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-08-24 05:31:57,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48129981606376454 [2023-08-24 05:31:57,984 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-08-24 05:31:57,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-08-24 05:31:57,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:57,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-08-24 05:31:57,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 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:31:57,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:31:57,990 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:31:57,990 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 168 flow. Second operand 7 states and 785 transitions. [2023-08-24 05:31:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 140 transitions, 900 flow [2023-08-24 05:31:58,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 140 transitions, 896 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:58,175 INFO L231 Difference]: Finished difference. Result has 54 places, 61 transitions, 401 flow [2023-08-24 05:31:58,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=54, PETRI_TRANSITIONS=61} [2023-08-24 05:31:58,177 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-08-24 05:31:58,179 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 61 transitions, 401 flow [2023-08-24 05:31:58,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 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:31:58,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:58,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:58,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:31:58,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:31:58,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1141854111, now seen corresponding path program 1 times [2023-08-24 05:31:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443357706] [2023-08-24 05:31:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:58,837 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:31:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:58,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443357706] [2023-08-24 05:31:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443357706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:31:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852795897] [2023-08-24 05:31:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:58,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:31:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:31:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:31:58,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 05:31:58,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 61 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 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:31:58,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:58,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 05:31:58,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:00,569 INFO L124 PetriNetUnfolderBase]: 12957/17527 cut-off events. [2023-08-24 05:32:00,570 INFO L125 PetriNetUnfolderBase]: For 36193/36193 co-relation queries the response was YES. [2023-08-24 05:32:00,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67790 conditions, 17527 events. 12957/17527 cut-off events. For 36193/36193 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 86231 event pairs, 3798 based on Foata normal form. 552/18079 useless extension candidates. Maximal degree in co-relation 67770. Up to 13770 conditions per place. [2023-08-24 05:32:00,710 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 61 selfloop transitions, 42 changer transitions 35/138 dead transitions. [2023-08-24 05:32:00,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 138 transitions, 1088 flow [2023-08-24 05:32:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:32:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:32:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2023-08-24 05:32:00,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842632331902718 [2023-08-24 05:32:00,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 677 transitions. [2023-08-24 05:32:00,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 677 transitions. [2023-08-24 05:32:00,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:00,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 677 transitions. [2023-08-24 05:32:00,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 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:32:00,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:00,719 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:00,719 INFO L175 Difference]: Start difference. First operand has 54 places, 61 transitions, 401 flow. Second operand 6 states and 677 transitions. [2023-08-24 05:32:00,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 138 transitions, 1088 flow [2023-08-24 05:32:00,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 138 transitions, 1074 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-24 05:32:00,820 INFO L231 Difference]: Finished difference. Result has 59 places, 74 transitions, 694 flow [2023-08-24 05:32:00,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=59, PETRI_TRANSITIONS=74} [2023-08-24 05:32:00,822 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-08-24 05:32:00,822 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 74 transitions, 694 flow [2023-08-24 05:32:00,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 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:32:00,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:00,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:00,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:32:00,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:00,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 578547309, now seen corresponding path program 2 times [2023-08-24 05:32:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:00,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182423581] [2023-08-24 05:32:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:00,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:01,391 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:32:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182423581] [2023-08-24 05:32:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182423581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:01,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:01,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:32:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017359948] [2023-08-24 05:32:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:01,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:32:01,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:32:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:32:01,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 05:32:01,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 74 transitions, 694 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 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:32:01,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:01,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 05:32:01,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:03,244 INFO L124 PetriNetUnfolderBase]: 10965/15095 cut-off events. [2023-08-24 05:32:03,244 INFO L125 PetriNetUnfolderBase]: For 62196/63689 co-relation queries the response was YES. [2023-08-24 05:32:03,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72627 conditions, 15095 events. 10965/15095 cut-off events. For 62196/63689 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 79034 event pairs, 3974 based on Foata normal form. 1287/16020 useless extension candidates. Maximal degree in co-relation 72602. Up to 11617 conditions per place. [2023-08-24 05:32:03,355 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 72 selfloop transitions, 15 changer transitions 27/127 dead transitions. [2023-08-24 05:32:03,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 1334 flow [2023-08-24 05:32:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:32:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:32:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-24 05:32:03,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133047210300429 [2023-08-24 05:32:03,357 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-24 05:32:03,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-24 05:32:03,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:03,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-24 05:32:03,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 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:32:03,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 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:32:03,361 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 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:32:03,361 INFO L175 Difference]: Start difference. First operand has 59 places, 74 transitions, 694 flow. Second operand 5 states and 598 transitions. [2023-08-24 05:32:03,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 127 transitions, 1334 flow [2023-08-24 05:32:03,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 127 transitions, 1292 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-24 05:32:03,446 INFO L231 Difference]: Finished difference. Result has 63 places, 83 transitions, 840 flow [2023-08-24 05:32:03,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=840, PETRI_PLACES=63, PETRI_TRANSITIONS=83} [2023-08-24 05:32:03,448 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-08-24 05:32:03,448 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 83 transitions, 840 flow [2023-08-24 05:32:03,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 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:32:03,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:03,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:03,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:32:03,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:03,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1945803378, now seen corresponding path program 1 times [2023-08-24 05:32:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619636795] [2023-08-24 05:32:03,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:03,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:03,879 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:32:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619636795] [2023-08-24 05:32:03,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619636795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:03,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:32:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471356948] [2023-08-24 05:32:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:03,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:32:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:03,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:32:03,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:32:03,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 05:32:03,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 83 transitions, 840 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 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:32:03,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:03,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 05:32:03,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:05,993 INFO L124 PetriNetUnfolderBase]: 12784/17321 cut-off events. [2023-08-24 05:32:05,993 INFO L125 PetriNetUnfolderBase]: For 71629/71629 co-relation queries the response was YES. [2023-08-24 05:32:06,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88568 conditions, 17321 events. 12784/17321 cut-off events. For 71629/71629 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 86311 event pairs, 2411 based on Foata normal form. 495/17816 useless extension candidates. Maximal degree in co-relation 88539. Up to 11871 conditions per place. [2023-08-24 05:32:06,137 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 116 selfloop transitions, 62 changer transitions 69/247 dead transitions. [2023-08-24 05:32:06,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 247 transitions, 2718 flow [2023-08-24 05:32:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:32:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:32:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1225 transitions. [2023-08-24 05:32:06,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779555208739758 [2023-08-24 05:32:06,144 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1225 transitions. [2023-08-24 05:32:06,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1225 transitions. [2023-08-24 05:32:06,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:06,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1225 transitions. [2023-08-24 05:32:06,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.36363636363636) internal successors, (1225), 11 states have internal predecessors, (1225), 0 states have call successors, (0), 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:32:06,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 233.0) internal successors, (2796), 12 states have internal predecessors, (2796), 0 states have call successors, (0), 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:32:06,153 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 233.0) internal successors, (2796), 12 states have internal predecessors, (2796), 0 states have call successors, (0), 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:32:06,153 INFO L175 Difference]: Start difference. First operand has 63 places, 83 transitions, 840 flow. Second operand 11 states and 1225 transitions. [2023-08-24 05:32:06,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 247 transitions, 2718 flow [2023-08-24 05:32:06,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 247 transitions, 2657 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-08-24 05:32:06,347 INFO L231 Difference]: Finished difference. Result has 78 places, 119 transitions, 1549 flow [2023-08-24 05:32:06,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1549, PETRI_PLACES=78, PETRI_TRANSITIONS=119} [2023-08-24 05:32:06,351 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-08-24 05:32:06,351 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 119 transitions, 1549 flow [2023-08-24 05:32:06,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 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:32:06,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:06,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:06,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:32:06,354 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:06,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1715127542, now seen corresponding path program 1 times [2023-08-24 05:32:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210004106] [2023-08-24 05:32:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:06,668 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:32:06,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210004106] [2023-08-24 05:32:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210004106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:06,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:06,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:32:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935336981] [2023-08-24 05:32:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:06,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:32:06,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:06,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:32:06,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:32:06,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 05:32:06,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 119 transitions, 1549 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 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:32:06,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:06,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 05:32:06,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:09,180 INFO L124 PetriNetUnfolderBase]: 16639/22625 cut-off events. [2023-08-24 05:32:09,180 INFO L125 PetriNetUnfolderBase]: For 234671/234671 co-relation queries the response was YES. [2023-08-24 05:32:09,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142993 conditions, 22625 events. 16639/22625 cut-off events. For 234671/234671 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 117988 event pairs, 3099 based on Foata normal form. 646/23271 useless extension candidates. Maximal degree in co-relation 142955. Up to 11310 conditions per place. [2023-08-24 05:32:09,405 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 132 selfloop transitions, 26 changer transitions 63/221 dead transitions. [2023-08-24 05:32:09,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 221 transitions, 3150 flow [2023-08-24 05:32:09,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:32:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:32:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2023-08-24 05:32:09,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47782546494992845 [2023-08-24 05:32:09,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2023-08-24 05:32:09,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2023-08-24 05:32:09,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:09,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2023-08-24 05:32:09,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 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:32:09,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:09,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:09,413 INFO L175 Difference]: Start difference. First operand has 78 places, 119 transitions, 1549 flow. Second operand 6 states and 668 transitions. [2023-08-24 05:32:09,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 221 transitions, 3150 flow [2023-08-24 05:32:10,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 221 transitions, 3046 flow, removed 52 selfloop flow, removed 5 redundant places. [2023-08-24 05:32:10,631 INFO L231 Difference]: Finished difference. Result has 77 places, 113 transitions, 1489 flow [2023-08-24 05:32:10,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1489, PETRI_PLACES=77, PETRI_TRANSITIONS=113} [2023-08-24 05:32:10,632 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-08-24 05:32:10,632 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 1489 flow [2023-08-24 05:32:10,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 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:32:10,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:10,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:10,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:32:10,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:10,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash 732862311, now seen corresponding path program 1 times [2023-08-24 05:32:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:10,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128831332] [2023-08-24 05:32:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:11,150 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:32:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128831332] [2023-08-24 05:32:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128831332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:11,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:32:11,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548857618] [2023-08-24 05:32:11,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:11,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:32:11,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:11,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:32:11,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:32:11,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 233 [2023-08-24 05:32:11,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 113 transitions, 1489 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:32:11,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:11,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 233 [2023-08-24 05:32:11,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:13,711 INFO L124 PetriNetUnfolderBase]: 15351/21039 cut-off events. [2023-08-24 05:32:13,712 INFO L125 PetriNetUnfolderBase]: For 168315/168315 co-relation queries the response was YES. [2023-08-24 05:32:13,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125583 conditions, 21039 events. 15351/21039 cut-off events. For 168315/168315 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 109782 event pairs, 5994 based on Foata normal form. 554/21593 useless extension candidates. Maximal degree in co-relation 125544. Up to 17257 conditions per place. [2023-08-24 05:32:13,855 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 94 selfloop transitions, 60 changer transitions 64/218 dead transitions. [2023-08-24 05:32:13,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 218 transitions, 3015 flow [2023-08-24 05:32:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:32:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:32:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-08-24 05:32:13,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47884733292458614 [2023-08-24 05:32:13,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-08-24 05:32:13,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-08-24 05:32:13,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:13,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-08-24 05:32:13,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 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:32:13,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:13,862 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:13,862 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 1489 flow. Second operand 7 states and 781 transitions. [2023-08-24 05:32:13,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 218 transitions, 3015 flow [2023-08-24 05:32:14,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 218 transitions, 2969 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-24 05:32:14,276 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 1773 flow [2023-08-24 05:32:14,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1773, PETRI_PLACES=84, PETRI_TRANSITIONS=119} [2023-08-24 05:32:14,277 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-08-24 05:32:14,277 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 1773 flow [2023-08-24 05:32:14,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:32:14,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:14,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:14,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:32:14,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:14,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1695038168, now seen corresponding path program 1 times [2023-08-24 05:32:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646447722] [2023-08-24 05:32:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:14,826 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:32:14,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646447722] [2023-08-24 05:32:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646447722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:14,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:14,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:32:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818977061] [2023-08-24 05:32:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:32:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:32:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:32:14,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-08-24 05:32:14,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 119 transitions, 1773 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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:32:14,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:14,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-08-24 05:32:14,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:17,202 INFO L124 PetriNetUnfolderBase]: 12974/18254 cut-off events. [2023-08-24 05:32:17,202 INFO L125 PetriNetUnfolderBase]: For 192098/192935 co-relation queries the response was YES. [2023-08-24 05:32:17,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120254 conditions, 18254 events. 12974/18254 cut-off events. For 192098/192935 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 101101 event pairs, 4722 based on Foata normal form. 925/19027 useless extension candidates. Maximal degree in co-relation 120210. Up to 13006 conditions per place. [2023-08-24 05:32:17,380 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 106 selfloop transitions, 32 changer transitions 35/190 dead transitions. [2023-08-24 05:32:17,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 2883 flow [2023-08-24 05:32:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:32:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:32:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-08-24 05:32:17,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076640098099325 [2023-08-24 05:32:17,382 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-08-24 05:32:17,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-08-24 05:32:17,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:17,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-08-24 05:32:17,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 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:32:17,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:17,387 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:17,387 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 1773 flow. Second operand 7 states and 828 transitions. [2023-08-24 05:32:17,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 2883 flow [2023-08-24 05:32:17,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 190 transitions, 2853 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-24 05:32:17,809 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 1939 flow [2023-08-24 05:32:17,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1939, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2023-08-24 05:32:17,809 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2023-08-24 05:32:17,809 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 1939 flow [2023-08-24 05:32:17,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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:32:17,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:17,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:17,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:32:17,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:17,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1653479723, now seen corresponding path program 1 times [2023-08-24 05:32:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:17,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053587851] [2023-08-24 05:32:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:17,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:18,241 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:32:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053587851] [2023-08-24 05:32:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053587851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:32:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439283374] [2023-08-24 05:32:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:18,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:32:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:32:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:32:18,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 05:32:18,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 123 transitions, 1939 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:32:18,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:18,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 05:32:18,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:21,767 INFO L124 PetriNetUnfolderBase]: 17947/24504 cut-off events. [2023-08-24 05:32:21,768 INFO L125 PetriNetUnfolderBase]: For 285064/285064 co-relation queries the response was YES. [2023-08-24 05:32:21,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167624 conditions, 24504 events. 17947/24504 cut-off events. For 285064/285064 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 131147 event pairs, 5946 based on Foata normal form. 465/24969 useless extension candidates. Maximal degree in co-relation 167577. Up to 18409 conditions per place. [2023-08-24 05:32:21,963 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 126 selfloop transitions, 107 changer transitions 44/277 dead transitions. [2023-08-24 05:32:21,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 277 transitions, 4363 flow [2023-08-24 05:32:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 05:32:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 05:32:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1106 transitions. [2023-08-24 05:32:21,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47467811158798284 [2023-08-24 05:32:21,967 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1106 transitions. [2023-08-24 05:32:21,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1106 transitions. [2023-08-24 05:32:21,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:21,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1106 transitions. [2023-08-24 05:32:21,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 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:32:21,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 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:32:21,973 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 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:32:21,973 INFO L175 Difference]: Start difference. First operand has 88 places, 123 transitions, 1939 flow. Second operand 10 states and 1106 transitions. [2023-08-24 05:32:21,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 277 transitions, 4363 flow [2023-08-24 05:32:23,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 277 transitions, 4275 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-08-24 05:32:23,006 INFO L231 Difference]: Finished difference. Result has 98 places, 176 transitions, 3247 flow [2023-08-24 05:32:23,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3247, PETRI_PLACES=98, PETRI_TRANSITIONS=176} [2023-08-24 05:32:23,007 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2023-08-24 05:32:23,007 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 176 transitions, 3247 flow [2023-08-24 05:32:23,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:32:23,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:23,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:23,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:32:23,008 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:23,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1638257483, now seen corresponding path program 2 times [2023-08-24 05:32:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:23,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414679770] [2023-08-24 05:32:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:23,346 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:32:23,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:23,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414679770] [2023-08-24 05:32:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414679770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:23,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:32:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133543011] [2023-08-24 05:32:23,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:23,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:32:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:23,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:32:23,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:32:23,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-24 05:32:23,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 176 transitions, 3247 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 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:32:23,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:23,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-24 05:32:23,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:26,476 INFO L124 PetriNetUnfolderBase]: 15797/22153 cut-off events. [2023-08-24 05:32:26,476 INFO L125 PetriNetUnfolderBase]: For 339091/339997 co-relation queries the response was YES. [2023-08-24 05:32:26,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171062 conditions, 22153 events. 15797/22153 cut-off events. For 339091/339997 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 125711 event pairs, 5598 based on Foata normal form. 1090/23052 useless extension candidates. Maximal degree in co-relation 171009. Up to 16041 conditions per place. [2023-08-24 05:32:26,718 INFO L140 encePairwiseOnDemand]: 223/233 looper letters, 152 selfloop transitions, 57 changer transitions 15/252 dead transitions. [2023-08-24 05:32:26,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 252 transitions, 4680 flow [2023-08-24 05:32:26,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:32:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:32:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2023-08-24 05:32:26,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107296137339056 [2023-08-24 05:32:26,720 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2023-08-24 05:32:26,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2023-08-24 05:32:26,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:26,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2023-08-24 05:32:26,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 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:32:26,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:26,723 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:26,723 INFO L175 Difference]: Start difference. First operand has 98 places, 176 transitions, 3247 flow. Second operand 6 states and 714 transitions. [2023-08-24 05:32:26,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 252 transitions, 4680 flow [2023-08-24 05:32:27,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 252 transitions, 4559 flow, removed 60 selfloop flow, removed 4 redundant places. [2023-08-24 05:32:27,485 INFO L231 Difference]: Finished difference. Result has 98 places, 193 transitions, 3691 flow [2023-08-24 05:32:27,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3166, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3691, PETRI_PLACES=98, PETRI_TRANSITIONS=193} [2023-08-24 05:32:27,486 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2023-08-24 05:32:27,486 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 193 transitions, 3691 flow [2023-08-24 05:32:27,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 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:32:27,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:27,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:27,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:32:27,486 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:27,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -382249703, now seen corresponding path program 3 times [2023-08-24 05:32:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356543702] [2023-08-24 05:32:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:32:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356543702] [2023-08-24 05:32:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356543702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:28,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:32:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421630192] [2023-08-24 05:32:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:28,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:32:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:28,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:32:28,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:32:28,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 233 [2023-08-24 05:32:28,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 193 transitions, 3691 flow. Second operand has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 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:32:28,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:28,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 233 [2023-08-24 05:32:28,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:31,788 INFO L124 PetriNetUnfolderBase]: 16058/22586 cut-off events. [2023-08-24 05:32:31,788 INFO L125 PetriNetUnfolderBase]: For 354650/355435 co-relation queries the response was YES. [2023-08-24 05:32:31,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179592 conditions, 22586 events. 16058/22586 cut-off events. For 354650/355435 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 129932 event pairs, 4823 based on Foata normal form. 1100/23526 useless extension candidates. Maximal degree in co-relation 179539. Up to 14293 conditions per place. [2023-08-24 05:32:31,988 INFO L140 encePairwiseOnDemand]: 224/233 looper letters, 163 selfloop transitions, 42 changer transitions 28/261 dead transitions. [2023-08-24 05:32:31,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 261 transitions, 5108 flow [2023-08-24 05:32:31,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:32:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:32:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-08-24 05:32:31,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49049662783568365 [2023-08-24 05:32:31,990 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-08-24 05:32:31,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-08-24 05:32:31,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:31,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-08-24 05:32:31,992 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:32:31,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:31,994 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:31,994 INFO L175 Difference]: Start difference. First operand has 98 places, 193 transitions, 3691 flow. Second operand 7 states and 800 transitions. [2023-08-24 05:32:31,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 261 transitions, 5108 flow [2023-08-24 05:32:32,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 261 transitions, 4963 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-24 05:32:32,645 INFO L231 Difference]: Finished difference. Result has 102 places, 199 transitions, 3844 flow [2023-08-24 05:32:32,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3550, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3844, PETRI_PLACES=102, PETRI_TRANSITIONS=199} [2023-08-24 05:32:32,646 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places. [2023-08-24 05:32:32,646 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 199 transitions, 3844 flow [2023-08-24 05:32:32,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 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:32:32,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:32,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:32,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:32:32,647 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:32,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash 324820390, now seen corresponding path program 1 times [2023-08-24 05:32:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904391924] [2023-08-24 05:32:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:32,767 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:32:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:32,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904391924] [2023-08-24 05:32:32,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904391924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:32,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:32,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:32:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768390044] [2023-08-24 05:32:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:32,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:32:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:32:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:32:32,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 05:32:32,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 199 transitions, 3844 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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:32:32,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:32,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 05:32:32,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:34,833 INFO L124 PetriNetUnfolderBase]: 9107/13102 cut-off events. [2023-08-24 05:32:34,833 INFO L125 PetriNetUnfolderBase]: For 331630/338654 co-relation queries the response was YES. [2023-08-24 05:32:34,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114664 conditions, 13102 events. 9107/13102 cut-off events. For 331630/338654 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 74906 event pairs, 2693 based on Foata normal form. 1701/14427 useless extension candidates. Maximal degree in co-relation 114609. Up to 10081 conditions per place. [2023-08-24 05:32:34,953 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 180 selfloop transitions, 5 changer transitions 10/225 dead transitions. [2023-08-24 05:32:34,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 225 transitions, 4740 flow [2023-08-24 05:32:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:32:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:32:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-24 05:32:34,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207439198855508 [2023-08-24 05:32:34,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-24 05:32:34,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-24 05:32:34,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:34,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-24 05:32:34,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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:32:34,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 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:32:34,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 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:32:34,956 INFO L175 Difference]: Start difference. First operand has 102 places, 199 transitions, 3844 flow. Second operand 3 states and 364 transitions. [2023-08-24 05:32:34,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 225 transitions, 4740 flow [2023-08-24 05:32:35,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 225 transitions, 4488 flow, removed 50 selfloop flow, removed 7 redundant places. [2023-08-24 05:32:35,377 INFO L231 Difference]: Finished difference. Result has 96 places, 167 transitions, 2990 flow [2023-08-24 05:32:35,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2990, PETRI_PLACES=96, PETRI_TRANSITIONS=167} [2023-08-24 05:32:35,378 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2023-08-24 05:32:35,378 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 167 transitions, 2990 flow [2023-08-24 05:32:35,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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:32:35,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:35,378 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:32:35,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:32:35,378 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:35,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash -135853254, now seen corresponding path program 1 times [2023-08-24 05:32:35,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:35,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168189782] [2023-08-24 05:32:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:35,521 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:32:35,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:35,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168189782] [2023-08-24 05:32:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168189782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:32:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858941350] [2023-08-24 05:32:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:35,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:32:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:32:35,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:32:35,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 05:32:35,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 167 transitions, 2990 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 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:32:35,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:35,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 05:32:35,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:36,595 INFO L124 PetriNetUnfolderBase]: 4266/6491 cut-off events. [2023-08-24 05:32:36,595 INFO L125 PetriNetUnfolderBase]: For 144621/147121 co-relation queries the response was YES. [2023-08-24 05:32:36,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56138 conditions, 6491 events. 4266/6491 cut-off events. For 144621/147121 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 35874 event pairs, 709 based on Foata normal form. 973/7323 useless extension candidates. Maximal degree in co-relation 56087. Up to 3586 conditions per place. [2023-08-24 05:32:36,644 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 194 selfloop transitions, 9 changer transitions 22/255 dead transitions. [2023-08-24 05:32:36,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 255 transitions, 5067 flow [2023-08-24 05:32:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:32:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:32:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-24 05:32:36,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225321888412017 [2023-08-24 05:32:36,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-24 05:32:36,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-24 05:32:36,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:36,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-24 05:32:36,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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:32:36,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 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:32:36,648 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 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:32:36,648 INFO L175 Difference]: Start difference. First operand has 96 places, 167 transitions, 2990 flow. Second operand 4 states and 487 transitions. [2023-08-24 05:32:36,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 255 transitions, 5067 flow [2023-08-24 05:32:36,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 255 transitions, 5028 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-24 05:32:36,760 INFO L231 Difference]: Finished difference. Result has 99 places, 154 transitions, 2695 flow [2023-08-24 05:32:36,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2837, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2695, PETRI_PLACES=99, PETRI_TRANSITIONS=154} [2023-08-24 05:32:36,761 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2023-08-24 05:32:36,761 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 154 transitions, 2695 flow [2023-08-24 05:32:36,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 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:32:36,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:36,762 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:32:36,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:32:36,762 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:36,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1549263549, now seen corresponding path program 1 times [2023-08-24 05:32:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114690436] [2023-08-24 05:32:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:36,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:37,053 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:32:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114690436] [2023-08-24 05:32:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114690436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:37,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:32:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224124047] [2023-08-24 05:32:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:37,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:32:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:37,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:32:37,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:32:37,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 233 [2023-08-24 05:32:37,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 154 transitions, 2695 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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:32:37,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:37,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 233 [2023-08-24 05:32:37,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:38,997 INFO L124 PetriNetUnfolderBase]: 7424/11236 cut-off events. [2023-08-24 05:32:38,997 INFO L125 PetriNetUnfolderBase]: For 203605/203605 co-relation queries the response was YES. [2023-08-24 05:32:39,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96022 conditions, 11236 events. 7424/11236 cut-off events. For 203605/203605 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 65160 event pairs, 843 based on Foata normal form. 124/11360 useless extension candidates. Maximal degree in co-relation 95969. Up to 6035 conditions per place. [2023-08-24 05:32:39,060 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 186 selfloop transitions, 62 changer transitions 126/374 dead transitions. [2023-08-24 05:32:39,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 374 transitions, 6817 flow [2023-08-24 05:32:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:32:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:32:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-08-24 05:32:39,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47884733292458614 [2023-08-24 05:32:39,062 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-08-24 05:32:39,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-08-24 05:32:39,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:39,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-08-24 05:32:39,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 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:32:39,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:39,066 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:39,066 INFO L175 Difference]: Start difference. First operand has 99 places, 154 transitions, 2695 flow. Second operand 7 states and 781 transitions. [2023-08-24 05:32:39,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 374 transitions, 6817 flow [2023-08-24 05:32:39,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 374 transitions, 6689 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-24 05:32:39,258 INFO L231 Difference]: Finished difference. Result has 107 places, 168 transitions, 3169 flow [2023-08-24 05:32:39,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2650, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3169, PETRI_PLACES=107, PETRI_TRANSITIONS=168} [2023-08-24 05:32:39,259 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places. [2023-08-24 05:32:39,259 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 168 transitions, 3169 flow [2023-08-24 05:32:39,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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:32:39,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:39,259 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:32:39,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:32:39,259 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:39,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -945239276, now seen corresponding path program 1 times [2023-08-24 05:32:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633207234] [2023-08-24 05:32:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:39,402 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:32:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633207234] [2023-08-24 05:32:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633207234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:39,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:39,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:32:39,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034565563] [2023-08-24 05:32:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:39,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:32:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:39,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:32:39,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:32:39,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 05:32:39,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 168 transitions, 3169 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:32:39,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:39,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 05:32:39,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:40,485 INFO L124 PetriNetUnfolderBase]: 4156/6380 cut-off events. [2023-08-24 05:32:40,485 INFO L125 PetriNetUnfolderBase]: For 154364/156535 co-relation queries the response was YES. [2023-08-24 05:32:40,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56907 conditions, 6380 events. 4156/6380 cut-off events. For 154364/156535 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 36758 event pairs, 436 based on Foata normal form. 781/7043 useless extension candidates. Maximal degree in co-relation 56850. Up to 3534 conditions per place. [2023-08-24 05:32:40,527 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 194 selfloop transitions, 13 changer transitions 33/271 dead transitions. [2023-08-24 05:32:40,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 271 transitions, 5672 flow [2023-08-24 05:32:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:32:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:32:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-24 05:32:40,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218884120171674 [2023-08-24 05:32:40,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-24 05:32:40,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-24 05:32:40,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:40,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-24 05:32:40,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 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:32:40,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 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:32:40,531 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 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:32:40,531 INFO L175 Difference]: Start difference. First operand has 107 places, 168 transitions, 3169 flow. Second operand 5 states and 608 transitions. [2023-08-24 05:32:40,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 271 transitions, 5672 flow [2023-08-24 05:32:40,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 271 transitions, 5517 flow, removed 48 selfloop flow, removed 4 redundant places. [2023-08-24 05:32:40,773 INFO L231 Difference]: Finished difference. Result has 107 places, 150 transitions, 2713 flow [2023-08-24 05:32:40,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2713, PETRI_PLACES=107, PETRI_TRANSITIONS=150} [2023-08-24 05:32:40,774 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places. [2023-08-24 05:32:40,774 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 150 transitions, 2713 flow [2023-08-24 05:32:40,774 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:32:40,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:40,774 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:32:40,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 05:32:40,774 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:40,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1027359921, now seen corresponding path program 1 times [2023-08-24 05:32:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302624128] [2023-08-24 05:32:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:41,729 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:32:41,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:41,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302624128] [2023-08-24 05:32:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302624128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:41,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:41,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:32:41,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221392911] [2023-08-24 05:32:41,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:41,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:32:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:32:41,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:32:41,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 233 [2023-08-24 05:32:41,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 150 transitions, 2713 flow. Second operand has 10 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 0 states have call successors, (0), 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:32:41,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:41,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 233 [2023-08-24 05:32:41,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:43,817 INFO L124 PetriNetUnfolderBase]: 7625/11762 cut-off events. [2023-08-24 05:32:43,817 INFO L125 PetriNetUnfolderBase]: For 210851/210851 co-relation queries the response was YES. [2023-08-24 05:32:43,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98806 conditions, 11762 events. 7625/11762 cut-off events. For 210851/210851 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 71919 event pairs, 882 based on Foata normal form. 24/11786 useless extension candidates. Maximal degree in co-relation 98749. Up to 5493 conditions per place. [2023-08-24 05:32:43,896 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 200 selfloop transitions, 97 changer transitions 52/349 dead transitions. [2023-08-24 05:32:43,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 349 transitions, 6257 flow [2023-08-24 05:32:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 05:32:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 05:32:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1241 transitions. [2023-08-24 05:32:43,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4438483547925608 [2023-08-24 05:32:43,899 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1241 transitions. [2023-08-24 05:32:43,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1241 transitions. [2023-08-24 05:32:43,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:43,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1241 transitions. [2023-08-24 05:32:43,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 103.41666666666667) internal successors, (1241), 12 states have internal predecessors, (1241), 0 states have call successors, (0), 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:32:43,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 233.0) internal successors, (3029), 13 states have internal predecessors, (3029), 0 states have call successors, (0), 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:32:43,906 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 233.0) internal successors, (3029), 13 states have internal predecessors, (3029), 0 states have call successors, (0), 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:32:43,906 INFO L175 Difference]: Start difference. First operand has 107 places, 150 transitions, 2713 flow. Second operand 12 states and 1241 transitions. [2023-08-24 05:32:43,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 349 transitions, 6257 flow [2023-08-24 05:32:44,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 349 transitions, 6005 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-08-24 05:32:44,426 INFO L231 Difference]: Finished difference. Result has 122 places, 177 transitions, 3635 flow [2023-08-24 05:32:44,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3635, PETRI_PLACES=122, PETRI_TRANSITIONS=177} [2023-08-24 05:32:44,426 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 78 predicate places. [2023-08-24 05:32:44,427 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 177 transitions, 3635 flow [2023-08-24 05:32:44,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 0 states have call successors, (0), 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:32:44,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:44,427 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:32:44,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 05:32:44,427 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:44,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash -541380358, now seen corresponding path program 1 times [2023-08-24 05:32:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101644441] [2023-08-24 05:32:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:44,722 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:32:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101644441] [2023-08-24 05:32:44,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101644441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:44,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:44,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:32:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656094293] [2023-08-24 05:32:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:44,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:32:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:32:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:32:44,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 233 [2023-08-24 05:32:44,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 177 transitions, 3635 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 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:32:44,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:44,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 233 [2023-08-24 05:32:44,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:47,181 INFO L124 PetriNetUnfolderBase]: 8924/14056 cut-off events. [2023-08-24 05:32:47,181 INFO L125 PetriNetUnfolderBase]: For 307486/307486 co-relation queries the response was YES. [2023-08-24 05:32:47,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121016 conditions, 14056 events. 8924/14056 cut-off events. For 307486/307486 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 90841 event pairs, 1792 based on Foata normal form. 37/14093 useless extension candidates. Maximal degree in co-relation 120952. Up to 6716 conditions per place. [2023-08-24 05:32:47,293 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 174 selfloop transitions, 47 changer transitions 158/379 dead transitions. [2023-08-24 05:32:47,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 379 transitions, 7963 flow [2023-08-24 05:32:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:32:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:32:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2023-08-24 05:32:47,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46842427958307786 [2023-08-24 05:32:47,294 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2023-08-24 05:32:47,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2023-08-24 05:32:47,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:47,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2023-08-24 05:32:47,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:32:47,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:47,297 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 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:32:47,297 INFO L175 Difference]: Start difference. First operand has 122 places, 177 transitions, 3635 flow. Second operand 7 states and 764 transitions. [2023-08-24 05:32:47,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 379 transitions, 7963 flow [2023-08-24 05:32:47,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 379 transitions, 7922 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-24 05:32:47,936 INFO L231 Difference]: Finished difference. Result has 122 places, 151 transitions, 3104 flow [2023-08-24 05:32:47,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3622, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3104, PETRI_PLACES=122, PETRI_TRANSITIONS=151} [2023-08-24 05:32:47,937 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 78 predicate places. [2023-08-24 05:32:47,937 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 3104 flow [2023-08-24 05:32:47,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 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:32:47,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:47,937 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:32:47,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 05:32:47,937 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:47,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -808871141, now seen corresponding path program 2 times [2023-08-24 05:32:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:47,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821306958] [2023-08-24 05:32:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:48,315 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:32:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:48,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821306958] [2023-08-24 05:32:48,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821306958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:48,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:32:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128866222] [2023-08-24 05:32:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:48,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:32:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:32:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:32:48,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 05:32:48,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 3104 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 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:32:48,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:48,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 05:32:48,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:49,544 INFO L124 PetriNetUnfolderBase]: 5174/8289 cut-off events. [2023-08-24 05:32:49,544 INFO L125 PetriNetUnfolderBase]: For 224845/227228 co-relation queries the response was YES. [2023-08-24 05:32:49,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73084 conditions, 8289 events. 5174/8289 cut-off events. For 224845/227228 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 54928 event pairs, 527 based on Foata normal form. 521/8617 useless extension candidates. Maximal degree in co-relation 73021. Up to 3843 conditions per place. [2023-08-24 05:32:49,602 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 82 selfloop transitions, 17 changer transitions 153/260 dead transitions. [2023-08-24 05:32:49,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 260 transitions, 5973 flow [2023-08-24 05:32:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:32:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:32:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-08-24 05:32:49,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114449213161659 [2023-08-24 05:32:49,604 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-08-24 05:32:49,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-08-24 05:32:49,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:49,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-08-24 05:32:49,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 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:32:49,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:49,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:32:49,607 INFO L175 Difference]: Start difference. First operand has 122 places, 151 transitions, 3104 flow. Second operand 6 states and 715 transitions. [2023-08-24 05:32:49,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 260 transitions, 5973 flow [2023-08-24 05:32:50,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 260 transitions, 5561 flow, removed 106 selfloop flow, removed 4 redundant places. [2023-08-24 05:32:50,023 INFO L231 Difference]: Finished difference. Result has 123 places, 62 transitions, 971 flow [2023-08-24 05:32:50,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=971, PETRI_PLACES=123, PETRI_TRANSITIONS=62} [2023-08-24 05:32:50,023 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2023-08-24 05:32:50,023 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 62 transitions, 971 flow [2023-08-24 05:32:50,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 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:32:50,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:50,024 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:32:50,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 05:32:50,024 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:50,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1776386699, now seen corresponding path program 1 times [2023-08-24 05:32:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665117711] [2023-08-24 05:32:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:50,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:32:51,301 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:32:51,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:32:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665117711] [2023-08-24 05:32:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665117711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:32:51,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:32:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 05:32:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603609517] [2023-08-24 05:32:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:32:51,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 05:32:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:32:51,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 05:32:51,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-24 05:32:51,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-24 05:32:51,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 62 transitions, 971 flow. Second operand has 11 states, 11 states have (on average 100.27272727272727) internal successors, (1103), 11 states have internal predecessors, (1103), 0 states have call successors, (0), 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:32:51,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:32:51,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-24 05:32:51,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:32:51,904 INFO L124 PetriNetUnfolderBase]: 1570/2629 cut-off events. [2023-08-24 05:32:51,904 INFO L125 PetriNetUnfolderBase]: For 42855/42882 co-relation queries the response was YES. [2023-08-24 05:32:51,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19408 conditions, 2629 events. 1570/2629 cut-off events. For 42855/42882 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13851 event pairs, 267 based on Foata normal form. 2/2620 useless extension candidates. Maximal degree in co-relation 19364. Up to 972 conditions per place. [2023-08-24 05:32:51,927 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 78 selfloop transitions, 8 changer transitions 51/140 dead transitions. [2023-08-24 05:32:51,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 140 transitions, 2055 flow [2023-08-24 05:32:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:32:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:32:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 860 transitions. [2023-08-24 05:32:51,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613733905579399 [2023-08-24 05:32:51,929 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 860 transitions. [2023-08-24 05:32:51,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 860 transitions. [2023-08-24 05:32:51,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:32:51,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 860 transitions. [2023-08-24 05:32:51,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 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:32:51,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 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:32:51,932 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 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:32:51,932 INFO L175 Difference]: Start difference. First operand has 123 places, 62 transitions, 971 flow. Second operand 8 states and 860 transitions. [2023-08-24 05:32:51,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 140 transitions, 2055 flow [2023-08-24 05:32:52,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 140 transitions, 1259 flow, removed 266 selfloop flow, removed 41 redundant places. [2023-08-24 05:32:52,015 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 491 flow [2023-08-24 05:32:52,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2023-08-24 05:32:52,016 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-08-24 05:32:52,016 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 491 flow [2023-08-24 05:32:52,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.27272727272727) internal successors, (1103), 11 states have internal predecessors, (1103), 0 states have call successors, (0), 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:32:52,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:32:52,016 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:32:52,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 05:32:52,016 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:32:52,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:32:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1824657141, now seen corresponding path program 2 times [2023-08-24 05:32:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:32:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82457772] [2023-08-24 05:32:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:32:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:32:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:32:52,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:32:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:32:52,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:32:52,116 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:32:52,117 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:32:52,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:32:52,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:32:52,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:32:52,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:32:52,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:32:52,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:32:52,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 05:32:52,121 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:32:52,127 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:32:52,127 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:32:52,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:32:52 BasicIcfg [2023-08-24 05:32:52,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:32:52,239 INFO L158 Benchmark]: Toolchain (without parser) took 66583.95ms. Allocated memory was 358.6MB in the beginning and 12.8GB in the end (delta: 12.5GB). Free memory was 333.3MB in the beginning and 10.6GB in the end (delta: -10.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-24 05:32:52,239 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory is still 334.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:32:52,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.53ms. Allocated memory is still 358.6MB. Free memory was 333.0MB in the beginning and 309.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:32:52,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.38ms. Allocated memory is still 358.6MB. Free memory was 309.0MB in the beginning and 306.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:32:52,240 INFO L158 Benchmark]: Boogie Preprocessor took 31.76ms. Allocated memory is still 358.6MB. Free memory was 306.4MB in the beginning and 304.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:32:52,241 INFO L158 Benchmark]: RCFGBuilder took 807.11ms. Allocated memory is still 358.6MB. Free memory was 304.3MB in the beginning and 314.8MB in the end (delta: -10.5MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. [2023-08-24 05:32:52,241 INFO L158 Benchmark]: TraceAbstraction took 65190.73ms. Allocated memory was 358.6MB in the beginning and 12.8GB in the end (delta: 12.5GB). Free memory was 314.0MB in the beginning and 10.6GB in the end (delta: -10.3GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-24 05:32:52,242 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory is still 334.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 489.53ms. Allocated memory is still 358.6MB. Free memory was 333.0MB in the beginning and 309.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.38ms. Allocated memory is still 358.6MB. Free memory was 309.0MB in the beginning and 306.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.76ms. Allocated memory is still 358.6MB. Free memory was 306.4MB in the beginning and 304.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 807.11ms. Allocated memory is still 358.6MB. Free memory was 304.3MB in the beginning and 314.8MB in the end (delta: -10.5MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. * TraceAbstraction took 65190.73ms. Allocated memory was 358.6MB in the beginning and 12.8GB in the end (delta: 12.5GB). Free memory was 314.0MB in the beginning and 10.6GB in the end (delta: -10.3GB). Peak memory consumption was 2.8GB. 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, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 32 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 8921 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3359, independent: 3121, independent conditional: 0, independent unconditional: 3121, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1558, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3359, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 1558, unknown conditional: 0, unknown unconditional: 1558] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-3, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-2, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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: 847]: 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, 164 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: 65.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1107 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1107 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3679 IncrementalHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 119 mSDtfsCounter, 3679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3844occurred in iteration=12, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 4022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:32:52,260 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...