/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_37-indirect_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:16:41,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:16:41,109 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-NoLbe.epf [2023-12-05 21:16:41,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:16:41,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:16:41,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:16:41,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:16:41,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:16:41,147 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:16:41,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:16:41,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:16:41,150 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:16:41,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:16:41,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:16:41,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:16:41,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:16:41,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:16:41,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:16:41,152 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:16:41,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:16:41,152 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:16:41,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:16:41,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:16:41,153 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:16:41,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:16:41,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:41,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:16:41,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:16:41,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:16:41,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:16:41,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:16:41,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:16:41,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:16:41,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:16:41,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:16:41,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:16:41,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:16:41,366 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:16:41,366 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:16:41,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_37-indirect_racing.i [2023-12-05 21:16:42,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:16:42,671 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:16:42,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_37-indirect_racing.i [2023-12-05 21:16:42,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebf4d071/7c4e03c658224777b9c39835e50d2274/FLAGf2acf033b [2023-12-05 21:16:42,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebf4d071/7c4e03c658224777b9c39835e50d2274 [2023-12-05 21:16:42,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:16:42,696 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:16:42,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:42,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:16:42,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:16:42,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:42" (1/1) ... [2023-12-05 21:16:42,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30acbd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:42, skipping insertion in model container [2023-12-05 21:16:42,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:42" (1/1) ... [2023-12-05 21:16:42,740 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:16:42,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:43,003 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:16:43,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:43,080 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:16:43,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43 WrapperNode [2023-12-05 21:16:43,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:43,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:43,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:16:43,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:16:43,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,130 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2023-12-05 21:16:43,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:43,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:16:43,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:16:43,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:16:43,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:16:43,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:16:43,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:16:43,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:16:43,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (1/1) ... [2023-12-05 21:16:43,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:43,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:43,212 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-12-05 21:16:43,219 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-12-05 21:16:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:16:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:16:43,236 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:16:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:16:43,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:16:43,238 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:16:43,325 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:16:43,327 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:16:43,495 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:16:43,519 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:16:43,520 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:16:43,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:43 BoogieIcfgContainer [2023-12-05 21:16:43,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:16:43,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:16:43,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:16:43,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:16:43,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:16:42" (1/3) ... [2023-12-05 21:16:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28595988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:43, skipping insertion in model container [2023-12-05 21:16:43,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:43" (2/3) ... [2023-12-05 21:16:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28595988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:43, skipping insertion in model container [2023-12-05 21:16:43,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:43" (3/3) ... [2023-12-05 21:16:43,527 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2023-12-05 21:16:43,539 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:16:43,540 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-05 21:16:43,540 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:16:43,585 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:16:43,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 134 transitions, 275 flow [2023-12-05 21:16:43,683 INFO L124 PetriNetUnfolderBase]: 19/182 cut-off events. [2023-12-05 21:16:43,684 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:16:43,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 182 events. 19/182 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 596 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 96. Up to 4 conditions per place. [2023-12-05 21:16:43,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 134 transitions, 275 flow [2023-12-05 21:16:43,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 134 transitions, 275 flow [2023-12-05 21:16:43,742 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:43,752 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3d2bd9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:43,752 INFO L363 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-12-05 21:16:43,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:43,766 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2023-12-05 21:16:43,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:43,766 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:43,766 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:43,767 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:43,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -765225663, now seen corresponding path program 1 times [2023-12-05 21:16:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:43,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434179726] [2023-12-05 21:16:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434179726] [2023-12-05 21:16:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434179726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:44,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867868667] [2023-12-05 21:16:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:44,049 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:44,071 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 134 [2023-12-05 21:16:44,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 134 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:44,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 134 [2023-12-05 21:16:44,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:44,244 INFO L124 PetriNetUnfolderBase]: 155/666 cut-off events. [2023-12-05 21:16:44,244 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:16:44,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 666 events. 155/666 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4292 event pairs, 112 based on Foata normal form. 122/673 useless extension candidates. Maximal degree in co-relation 924. Up to 257 conditions per place. [2023-12-05 21:16:44,253 INFO L140 encePairwiseOnDemand]: 118/134 looper letters, 44 selfloop transitions, 2 changer transitions 3/131 dead transitions. [2023-12-05 21:16:44,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 131 transitions, 367 flow [2023-12-05 21:16:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-12-05 21:16:44,268 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7985074626865671 [2023-12-05 21:16:44,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-12-05 21:16:44,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-12-05 21:16:44,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:44,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-12-05 21:16:44,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,282 INFO L308 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2023-12-05 21:16:44,282 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 131 transitions, 367 flow [2023-12-05 21:16:44,282 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,283 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:44,283 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:44,283 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:16:44,283 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:44,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash -765225662, now seen corresponding path program 1 times [2023-12-05 21:16:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:44,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950234111] [2023-12-05 21:16:44,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950234111] [2023-12-05 21:16:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950234111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488267645] [2023-12-05 21:16:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:44,410 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:44,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:44,411 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2023-12-05 21:16:44,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 131 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:44,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2023-12-05 21:16:44,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:44,647 INFO L124 PetriNetUnfolderBase]: 278/1058 cut-off events. [2023-12-05 21:16:44,647 INFO L125 PetriNetUnfolderBase]: For 205/221 co-relation queries the response was YES. [2023-12-05 21:16:44,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1058 events. 278/1058 cut-off events. For 205/221 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7203 event pairs, 46 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 1960. Up to 424 conditions per place. [2023-12-05 21:16:44,654 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 70 selfloop transitions, 4 changer transitions 6/161 dead transitions. [2023-12-05 21:16:44,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 161 transitions, 629 flow [2023-12-05 21:16:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2023-12-05 21:16:44,657 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-12-05 21:16:44,657 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 388 transitions. [2023-12-05 21:16:44,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 388 transitions. [2023-12-05 21:16:44,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:44,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 388 transitions. [2023-12-05 21:16:44,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,662 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,663 INFO L308 CegarLoopForPetriNet]: 124 programPoint places, 0 predicate places. [2023-12-05 21:16:44,663 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 161 transitions, 629 flow [2023-12-05 21:16:44,663 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,663 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:44,664 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:44,664 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:16:44,664 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:44,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash -89460130, now seen corresponding path program 1 times [2023-12-05 21:16:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:44,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706561914] [2023-12-05 21:16:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706561914] [2023-12-05 21:16:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706561914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:44,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:44,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:16:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674277334] [2023-12-05 21:16:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:44,897 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:16:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:16:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:16:44,900 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 134 [2023-12-05 21:16:44,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 161 transitions, 629 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:44,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:44,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 134 [2023-12-05 21:16:44,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:45,208 INFO L124 PetriNetUnfolderBase]: 251/1054 cut-off events. [2023-12-05 21:16:45,209 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2023-12-05 21:16:45,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1054 events. 251/1054 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6983 event pairs, 14 based on Foata normal form. 64/1039 useless extension candidates. Maximal degree in co-relation 2383. Up to 392 conditions per place. [2023-12-05 21:16:45,215 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 89 selfloop transitions, 13 changer transitions 12/186 dead transitions. [2023-12-05 21:16:45,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 186 transitions, 989 flow [2023-12-05 21:16:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:16:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:16:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 767 transitions. [2023-12-05 21:16:45,217 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6359867330016584 [2023-12-05 21:16:45,217 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 767 transitions. [2023-12-05 21:16:45,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 767 transitions. [2023-12-05 21:16:45,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:45,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 767 transitions. [2023-12-05 21:16:45,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,222 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,222 INFO L308 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2023-12-05 21:16:45,223 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 186 transitions, 989 flow [2023-12-05 21:16:45,223 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,223 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:45,223 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:45,223 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:16:45,223 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:45,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -89460129, now seen corresponding path program 1 times [2023-12-05 21:16:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204228161] [2023-12-05 21:16:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:45,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204228161] [2023-12-05 21:16:45,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204228161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:45,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:16:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525510148] [2023-12-05 21:16:45,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:45,478 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:16:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:45,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:16:45,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:16:45,480 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 134 [2023-12-05 21:16:45,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 186 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:45,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 134 [2023-12-05 21:16:45,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:45,703 INFO L124 PetriNetUnfolderBase]: 163/762 cut-off events. [2023-12-05 21:16:45,703 INFO L125 PetriNetUnfolderBase]: For 1096/1096 co-relation queries the response was YES. [2023-12-05 21:16:45,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 762 events. 163/762 cut-off events. For 1096/1096 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4430 event pairs, 10 based on Foata normal form. 96/799 useless extension candidates. Maximal degree in co-relation 1982. Up to 264 conditions per place. [2023-12-05 21:16:45,706 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 39 selfloop transitions, 5 changer transitions 41/155 dead transitions. [2023-12-05 21:16:45,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 155 transitions, 969 flow [2023-12-05 21:16:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 574 transitions. [2023-12-05 21:16:45,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2023-12-05 21:16:45,709 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 574 transitions. [2023-12-05 21:16:45,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 574 transitions. [2023-12-05 21:16:45,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:45,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 574 transitions. [2023-12-05 21:16:45,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 82.0) internal successors, (574), 7 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,712 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,714 INFO L308 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2023-12-05 21:16:45,714 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 155 transitions, 969 flow [2023-12-05 21:16:45,714 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:45,714 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:45,715 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:16:45,715 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:16:45,715 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:45,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -476711479, now seen corresponding path program 1 times [2023-12-05 21:16:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771038164] [2023-12-05 21:16:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771038164] [2023-12-05 21:16:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771038164] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502484216] [2023-12-05 21:16:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:45,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:45,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:16:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:45,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:45,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:45,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:16:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:46,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:46,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502484216] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:46,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:46,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:46,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58632448] [2023-12-05 21:16:46,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:46,226 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:46,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:46,229 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2023-12-05 21:16:46,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 155 transitions, 969 flow. Second operand has 14 states, 14 states have (on average 80.57142857142857) internal successors, (1128), 14 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:46,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2023-12-05 21:16:46,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:46,385 INFO L124 PetriNetUnfolderBase]: 50/208 cut-off events. [2023-12-05 21:16:46,385 INFO L125 PetriNetUnfolderBase]: For 551/553 co-relation queries the response was YES. [2023-12-05 21:16:46,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 208 events. 50/208 cut-off events. For 551/553 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 696 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 593. Up to 75 conditions per place. [2023-12-05 21:16:46,386 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 51 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2023-12-05 21:16:46,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 762 flow [2023-12-05 21:16:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 604 transitions. [2023-12-05 21:16:46,388 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6439232409381663 [2023-12-05 21:16:46,388 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 604 transitions. [2023-12-05 21:16:46,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 604 transitions. [2023-12-05 21:16:46,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:46,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 604 transitions. [2023-12-05 21:16:46,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,391 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,392 INFO L308 CegarLoopForPetriNet]: 124 programPoint places, -28 predicate places. [2023-12-05 21:16:46,392 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 762 flow [2023-12-05 21:16:46,392 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 80.57142857142857) internal successors, (1128), 14 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,392 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:46,393 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:16:46,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-05 21:16:46,597 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:46,598 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:16:46,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1893153624, now seen corresponding path program 1 times [2023-12-05 21:16:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047649205] [2023-12-05 21:16:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:46,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:46,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:46,638 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:46,639 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2023-12-05 21:16:46,640 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2023-12-05 21:16:46,640 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2023-12-05 21:16:46,640 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2023-12-05 21:16:46,640 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2023-12-05 21:16:46,641 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2023-12-05 21:16:46,642 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2023-12-05 21:16:46,643 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2023-12-05 21:16:46,643 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:16:46,643 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:16:46,645 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:46,645 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:16:46,663 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:16:46,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 179 transitions, 374 flow [2023-12-05 21:16:46,689 INFO L124 PetriNetUnfolderBase]: 34/303 cut-off events. [2023-12-05 21:16:46,689 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:16:46,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 303 events. 34/303 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1147 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 184. Up to 8 conditions per place. [2023-12-05 21:16:46,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 179 transitions, 374 flow [2023-12-05 21:16:46,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 179 transitions, 374 flow [2023-12-05 21:16:46,696 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:46,697 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3d2bd9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:46,697 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-12-05 21:16:46,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:46,700 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2023-12-05 21:16:46,700 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:46,700 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:46,700 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:46,700 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:46,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2138465684, now seen corresponding path program 1 times [2023-12-05 21:16:46,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:46,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751050885] [2023-12-05 21:16:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:46,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751050885] [2023-12-05 21:16:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751050885] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:46,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:46,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514707932] [2023-12-05 21:16:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:46,735 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:46,737 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 179 [2023-12-05 21:16:46,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 179 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:46,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 179 [2023-12-05 21:16:46,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:47,936 INFO L124 PetriNetUnfolderBase]: 5127/12592 cut-off events. [2023-12-05 21:16:47,936 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-12-05 21:16:47,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20805 conditions, 12592 events. 5127/12592 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 127371 event pairs, 3738 based on Foata normal form. 2666/12726 useless extension candidates. Maximal degree in co-relation 1667. Up to 5997 conditions per place. [2023-12-05 21:16:48,021 INFO L140 encePairwiseOnDemand]: 157/179 looper letters, 77 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2023-12-05 21:16:48,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 184 transitions, 542 flow [2023-12-05 21:16:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-12-05 21:16:48,023 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8044692737430168 [2023-12-05 21:16:48,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-12-05 21:16:48,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-12-05 21:16:48,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:48,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-12-05 21:16:48,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,027 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, -3 predicate places. [2023-12-05 21:16:48,027 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 184 transitions, 542 flow [2023-12-05 21:16:48,027 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,027 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:48,027 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:48,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:16:48,027 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:48,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2138465685, now seen corresponding path program 1 times [2023-12-05 21:16:48,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:48,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569682055] [2023-12-05 21:16:48,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:48,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569682055] [2023-12-05 21:16:48,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569682055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:48,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392260155] [2023-12-05 21:16:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:48,096 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:48,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:48,098 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 179 [2023-12-05 21:16:48,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 184 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:48,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 179 [2023-12-05 21:16:48,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:50,653 INFO L124 PetriNetUnfolderBase]: 11592/26712 cut-off events. [2023-12-05 21:16:50,653 INFO L125 PetriNetUnfolderBase]: For 6413/6889 co-relation queries the response was YES. [2023-12-05 21:16:50,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56955 conditions, 26712 events. 11592/26712 cut-off events. For 6413/6889 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 283784 event pairs, 5390 based on Foata normal form. 0/23792 useless extension candidates. Maximal degree in co-relation 6171. Up to 14005 conditions per place. [2023-12-05 21:16:50,831 INFO L140 encePairwiseOnDemand]: 173/179 looper letters, 118 selfloop transitions, 4 changer transitions 0/230 dead transitions. [2023-12-05 21:16:50,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 230 transitions, 940 flow [2023-12-05 21:16:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-12-05 21:16:50,834 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7150837988826816 [2023-12-05 21:16:50,834 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-12-05 21:16:50,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-12-05 21:16:50,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:50,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-12-05 21:16:50,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,836 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,837 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, 0 predicate places. [2023-12-05 21:16:50,837 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 230 transitions, 940 flow [2023-12-05 21:16:50,837 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,837 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:50,837 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:50,837 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:16:50,838 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:50,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1879052967, now seen corresponding path program 1 times [2023-12-05 21:16:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424108036] [2023-12-05 21:16:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424108036] [2023-12-05 21:16:51,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424108036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:51,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:51,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:16:51,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376209867] [2023-12-05 21:16:51,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:51,001 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:16:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:51,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:16:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:16:51,002 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 179 [2023-12-05 21:16:51,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 230 transitions, 940 flow. Second operand has 8 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:51,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 179 [2023-12-05 21:16:51,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:52,070 INFO L124 PetriNetUnfolderBase]: 3642/9650 cut-off events. [2023-12-05 21:16:52,072 INFO L125 PetriNetUnfolderBase]: For 7127/7127 co-relation queries the response was YES. [2023-12-05 21:16:52,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25907 conditions, 9650 events. 3642/9650 cut-off events. For 7127/7127 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 91640 event pairs, 1360 based on Foata normal form. 2848/11690 useless extension candidates. Maximal degree in co-relation 2202. Up to 5027 conditions per place. [2023-12-05 21:16:52,131 INFO L140 encePairwiseOnDemand]: 155/179 looper letters, 51 selfloop transitions, 5 changer transitions 45/192 dead transitions. [2023-12-05 21:16:52,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 192 transitions, 986 flow [2023-12-05 21:16:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-12-05 21:16:52,221 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5953711093375897 [2023-12-05 21:16:52,221 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-12-05 21:16:52,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-12-05 21:16:52,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:52,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-12-05 21:16:52,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,225 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,225 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, -12 predicate places. [2023-12-05 21:16:52,225 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 192 transitions, 986 flow [2023-12-05 21:16:52,225 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.375) internal successors, (755), 8 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,225 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:52,226 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:16:52,226 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:16:52,226 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:52,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1478769265, now seen corresponding path program 1 times [2023-12-05 21:16:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483807564] [2023-12-05 21:16:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:52,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483807564] [2023-12-05 21:16:52,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483807564] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:52,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112822409] [2023-12-05 21:16:52,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:52,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:52,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:52,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:52,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:16:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:52,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:52,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:52,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:16:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:52,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112822409] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:52,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:52,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791142292] [2023-12-05 21:16:52,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:52,545 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:52,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:52,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:52,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:52,546 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 179 [2023-12-05 21:16:52,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 192 transitions, 986 flow. Second operand has 14 states, 14 states have (on average 103.57142857142857) internal successors, (1450), 14 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:52,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 179 [2023-12-05 21:16:52,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:53,027 INFO L124 PetriNetUnfolderBase]: 1260/2757 cut-off events. [2023-12-05 21:16:53,027 INFO L125 PetriNetUnfolderBase]: For 5149/5175 co-relation queries the response was YES. [2023-12-05 21:16:53,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9863 conditions, 2757 events. 1260/2757 cut-off events. For 5149/5175 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 19049 event pairs, 0 based on Foata normal form. 0/2756 useless extension candidates. Maximal degree in co-relation 855. Up to 1889 conditions per place. [2023-12-05 21:16:53,047 INFO L140 encePairwiseOnDemand]: 172/179 looper letters, 124 selfloop transitions, 8 changer transitions 0/198 dead transitions. [2023-12-05 21:16:53,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 198 transitions, 1434 flow [2023-12-05 21:16:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:16:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:16:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1146 transitions. [2023-12-05 21:16:53,050 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6402234636871509 [2023-12-05 21:16:53,050 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1146 transitions. [2023-12-05 21:16:53,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1146 transitions. [2023-12-05 21:16:53,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:53,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1146 transitions. [2023-12-05 21:16:53,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,055 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,055 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, -38 predicate places. [2023-12-05 21:16:53,055 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 198 transitions, 1434 flow [2023-12-05 21:16:53,056 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 103.57142857142857) internal successors, (1450), 14 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,056 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:53,056 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-05 21:16:53,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:53,263 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-05 21:16:53,263 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:16:53,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash -468217277, now seen corresponding path program 1 times [2023-12-05 21:16:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:53,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314432783] [2023-12-05 21:16:53,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:53,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:53,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:53,301 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:53,301 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-12-05 21:16:53,301 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-12-05 21:16:53,301 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-12-05 21:16:53,301 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-12-05 21:16:53,301 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-12-05 21:16:53,302 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-12-05 21:16:53,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-12-05 21:16:53,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-12-05 21:16:53,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-12-05 21:16:53,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-12-05 21:16:53,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-12-05 21:16:53,305 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:16:53,306 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-05 21:16:53,306 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:53,306 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:16:53,412 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:16:53,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 224 transitions, 475 flow [2023-12-05 21:16:53,448 INFO L124 PetriNetUnfolderBase]: 54/463 cut-off events. [2023-12-05 21:16:53,449 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:16:53,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 463 events. 54/463 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1904 event pairs, 1 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 311. Up to 16 conditions per place. [2023-12-05 21:16:53,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 224 transitions, 475 flow [2023-12-05 21:16:53,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 224 transitions, 475 flow [2023-12-05 21:16:53,458 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:53,458 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3d2bd9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:53,458 INFO L363 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-12-05 21:16:53,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:53,460 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2023-12-05 21:16:53,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:53,460 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:53,460 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:53,460 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:16:53,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1525156468, now seen corresponding path program 1 times [2023-12-05 21:16:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:53,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496138478] [2023-12-05 21:16:53,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:53,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:53,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496138478] [2023-12-05 21:16:53,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496138478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:53,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:53,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935040157] [2023-12-05 21:16:53,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:53,490 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:53,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:53,491 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 224 [2023-12-05 21:16:53,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 224 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:53,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 224 [2023-12-05 21:16:53,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:21,051 INFO L124 PetriNetUnfolderBase]: 121612/237227 cut-off events. [2023-12-05 21:17:21,051 INFO L125 PetriNetUnfolderBase]: For 4141/4141 co-relation queries the response was YES. [2023-12-05 21:17:22,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407062 conditions, 237227 events. 121612/237227 cut-off events. For 4141/4141 co-relation queries the response was YES. Maximal size of possible extension queue 6827. Compared 2920174 event pairs, 88635 based on Foata normal form. 53030/238994 useless extension candidates. Maximal degree in co-relation 20786. Up to 123340 conditions per place. [2023-12-05 21:17:23,757 INFO L140 encePairwiseOnDemand]: 196/224 looper letters, 107 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2023-12-05 21:17:23,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 237 transitions, 719 flow [2023-12-05 21:17:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2023-12-05 21:17:23,759 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8080357142857143 [2023-12-05 21:17:23,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 543 transitions. [2023-12-05 21:17:23,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 543 transitions. [2023-12-05 21:17:23,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:23,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 543 transitions. [2023-12-05 21:17:23,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:23,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:23,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:23,762 INFO L308 CegarLoopForPetriNet]: 204 programPoint places, -3 predicate places. [2023-12-05 21:17:23,762 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 237 transitions, 719 flow [2023-12-05 21:17:23,762 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:23,762 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:23,763 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:23,763 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:17:23,763 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:17:23,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1525156469, now seen corresponding path program 1 times [2023-12-05 21:17:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888092020] [2023-12-05 21:17:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888092020] [2023-12-05 21:17:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888092020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678907431] [2023-12-05 21:17:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:23,803 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:23,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:23,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:23,804 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 224 [2023-12-05 21:17:23,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 237 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:23,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:23,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 224 [2023-12-05 21:17:23,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand