/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/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:05:54,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:05:54,772 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:05:54,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:05:54,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:05:54,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:05:54,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:05:54,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:05:54,799 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:05:54,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:05:54,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:05:54,805 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:05:54,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:05:54,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:05:54,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:05:54,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:05:54,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:05:54,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:05:54,807 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:05:54,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:05:54,807 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:05:54,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:05:54,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:05:54,808 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:05:54,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:05:54,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:05:54,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:05:54,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:05:54,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:05:54,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:05:54,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:05:54,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:05:54,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:05:54,810 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:05:55,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:05:55,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:05:55,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:05:55,037 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:05:55,037 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:05:55,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2023-12-05 21:05:56,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:05:56,371 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:05:56,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2023-12-05 21:05:56,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f304ffb68/b35fc935e96f476c9e29d11efe7acab9/FLAG46d3b0ff1 [2023-12-05 21:05:56,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f304ffb68/b35fc935e96f476c9e29d11efe7acab9 [2023-12-05 21:05:56,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:05:56,405 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:05:56,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:05:56,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:05:56,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:05:56,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b08bbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56, skipping insertion in model container [2023-12-05 21:05:56,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,459 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:05:56,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:05:56,754 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:05:56,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:05:56,816 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:05:56,816 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:05:56,821 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:05:56,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56 WrapperNode [2023-12-05 21:05:56,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:05:56,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:05:56,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:05:56,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:05:56,829 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:05:56" (1/1) ... [2023-12-05 21:05:56,850 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:05:56" (1/1) ... [2023-12-05 21:05:56,867 INFO L138 Inliner]: procedures = 170, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2023-12-05 21:05:56,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:05:56,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:05:56,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:05:56,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:05:56,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:05:56,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:05:56,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:05:56,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:05:56,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (1/1) ... [2023-12-05 21:05:56,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:05:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:05:56,927 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:05:56,971 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:05:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:05:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:05:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:05:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:05:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:05:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:05:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:05:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:05:56,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:05:56,991 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:05:57,070 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:05:57,071 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:05:57,182 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:05:57,215 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:05:57,215 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-05 21:05:57,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:05:57 BoogieIcfgContainer [2023-12-05 21:05:57,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:05:57,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:05:57,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:05:57,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:05:57,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:05:56" (1/3) ... [2023-12-05 21:05:57,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752509ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:05:57, skipping insertion in model container [2023-12-05 21:05:57,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:56" (2/3) ... [2023-12-05 21:05:57,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752509ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:05:57, skipping insertion in model container [2023-12-05 21:05:57,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:05:57" (3/3) ... [2023-12-05 21:05:57,223 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2023-12-05 21:05:57,236 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:05:57,236 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:05:57,236 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:05:57,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:57,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 86 flow [2023-12-05 21:05:57,331 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-12-05 21:05:57,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:57,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 27. Up to 4 conditions per place. [2023-12-05 21:05:57,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 41 transitions, 86 flow [2023-12-05 21:05:57,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 34 transitions, 72 flow [2023-12-05 21:05:57,345 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:57,351 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:57,369 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:57,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:57,380 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:05:57,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:57,380 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:57,381 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:57,389 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:57,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash -498927844, now seen corresponding path program 1 times [2023-12-05 21:05:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096235559] [2023-12-05 21:05:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:57,588 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:05:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:57,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096235559] [2023-12-05 21:05:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096235559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:57,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:57,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575278987] [2023-12-05 21:05:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:57,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:57,643 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 41 [2023-12-05 21:05:57,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:05:57,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:57,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 41 [2023-12-05 21:05:57,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:57,675 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2023-12-05 21:05:57,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 2 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 28. Up to 11 conditions per place. [2023-12-05 21:05:57,676 INFO L140 encePairwiseOnDemand]: 39/41 looper letters, 8 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-12-05 21:05:57,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 88 flow [2023-12-05 21:05:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-12-05 21:05:57,688 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7154471544715447 [2023-12-05 21:05:57,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-12-05 21:05:57,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-12-05 21:05:57,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:57,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-12-05 21:05:57,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:05:57,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:05:57,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:05:57,705 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-12-05 21:05:57,706 INFO L500 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 88 flow [2023-12-05 21:05:57,706 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:05:57,706 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:57,706 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:57,706 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:05:57,707 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:57,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -498927843, now seen corresponding path program 1 times [2023-12-05 21:05:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739712588] [2023-12-05 21:05:57,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:57,898 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:05:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739712588] [2023-12-05 21:05:57,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739712588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:57,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:57,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670977661] [2023-12-05 21:05:57,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:57,900 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:57,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:57,901 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 41 [2023-12-05 21:05:57,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:05:57,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:57,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 41 [2023-12-05 21:05:57,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:57,925 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-12-05 21:05:57,925 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-12-05 21:05:57,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 39 events. 1/39 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 18 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 26. Up to 7 conditions per place. [2023-12-05 21:05:57,925 INFO L140 encePairwiseOnDemand]: 39/41 looper letters, 6 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-12-05 21:05:57,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 98 flow [2023-12-05 21:05:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-12-05 21:05:57,929 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7235772357723578 [2023-12-05 21:05:57,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-12-05 21:05:57,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-12-05 21:05:57,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:57,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-12-05 21:05:57,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:05:57,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:05:57,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:05:57,931 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-12-05 21:05:57,932 INFO L500 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 98 flow [2023-12-05 21:05:57,932 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:05:57,932 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:57,932 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] [2023-12-05 21:05:57,932 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:05:57,932 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:57,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash 984487185, now seen corresponding path program 1 times [2023-12-05 21:05:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785028453] [2023-12-05 21:05:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:57,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:57,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:57,983 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:57,983 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:57,986 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:57,986 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:57,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:05:57,987 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:57,989 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:57,990 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:05:58,006 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:58,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 114 flow [2023-12-05 21:05:58,021 INFO L124 PetriNetUnfolderBase]: 3/80 cut-off events. [2023-12-05 21:05:58,022 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:05:58,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 80 events. 3/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 55. Up to 6 conditions per place. [2023-12-05 21:05:58,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 52 transitions, 114 flow [2023-12-05 21:05:58,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 45 transitions, 100 flow [2023-12-05 21:05:58,024 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:58,025 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:58,025 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:58,028 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:58,028 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:05:58,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:58,028 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,029 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,029 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1473294748, now seen corresponding path program 1 times [2023-12-05 21:05:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974374227] [2023-12-05 21:05:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,076 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:05:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974374227] [2023-12-05 21:05:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974374227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311947363] [2023-12-05 21:05:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,078 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,079 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 52 [2023-12-05 21:05:58,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:05:58,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 52 [2023-12-05 21:05:58,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:58,112 INFO L124 PetriNetUnfolderBase]: 12/95 cut-off events. [2023-12-05 21:05:58,112 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:05:58,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 95 events. 12/95 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 254 event pairs, 12 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 58. Up to 33 conditions per place. [2023-12-05 21:05:58,113 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 10 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-12-05 21:05:58,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 120 flow [2023-12-05 21:05:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-12-05 21:05:58,120 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.75 [2023-12-05 21:05:58,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-12-05 21:05:58,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-12-05 21:05:58,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:58,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-12-05 21:05:58,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:05:58,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:05:58,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:05:58,126 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-12-05 21:05:58,126 INFO L500 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 120 flow [2023-12-05 21:05:58,126 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:05:58,126 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,126 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,127 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:05:58,127 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1473294749, now seen corresponding path program 1 times [2023-12-05 21:05:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490087771] [2023-12-05 21:05:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,214 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:05:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490087771] [2023-12-05 21:05:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490087771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097634350] [2023-12-05 21:05:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,216 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,219 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 52 [2023-12-05 21:05:58,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:05:58,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 52 [2023-12-05 21:05:58,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:58,260 INFO L124 PetriNetUnfolderBase]: 7/83 cut-off events. [2023-12-05 21:05:58,260 INFO L125 PetriNetUnfolderBase]: For 21/31 co-relation queries the response was YES. [2023-12-05 21:05:58,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 83 events. 7/83 cut-off events. For 21/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 7 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 60. Up to 21 conditions per place. [2023-12-05 21:05:58,261 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 8 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-12-05 21:05:58,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 134 flow [2023-12-05 21:05:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-12-05 21:05:58,267 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2023-12-05 21:05:58,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-12-05 21:05:58,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-12-05 21:05:58,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:58,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-12-05 21:05:58,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:05:58,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:05:58,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:05:58,271 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-12-05 21:05:58,271 INFO L500 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 134 flow [2023-12-05 21:05:58,271 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:05:58,272 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,272 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,272 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:05:58,273 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -470511132, now seen corresponding path program 1 times [2023-12-05 21:05:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255643710] [2023-12-05 21:05:58,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:58,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:58,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:58,312 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:58,312 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:58,312 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:58,312 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:58,313 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:05:58,313 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:58,313 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:58,313 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:05:58,330 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:58,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 63 transitions, 144 flow [2023-12-05 21:05:58,347 INFO L124 PetriNetUnfolderBase]: 4/106 cut-off events. [2023-12-05 21:05:58,347 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:05:58,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 4/106 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 84. Up to 8 conditions per place. [2023-12-05 21:05:58,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 63 transitions, 144 flow [2023-12-05 21:05:58,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 56 transitions, 130 flow [2023-12-05 21:05:58,353 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:58,355 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:58,359 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:58,361 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:58,361 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:05:58,361 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:58,362 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,362 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,362 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1588586372, now seen corresponding path program 1 times [2023-12-05 21:05:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293088876] [2023-12-05 21:05:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,411 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:05:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293088876] [2023-12-05 21:05:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293088876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592256222] [2023-12-05 21:05:58,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,413 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,414 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 63 [2023-12-05 21:05:58,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:05:58,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 63 [2023-12-05 21:05:58,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:58,462 INFO L124 PetriNetUnfolderBase]: 44/211 cut-off events. [2023-12-05 21:05:58,463 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-12-05 21:05:58,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 211 events. 44/211 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 960 event pairs, 44 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 136. Up to 89 conditions per place. [2023-12-05 21:05:58,467 INFO L140 encePairwiseOnDemand]: 61/63 looper letters, 12 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-12-05 21:05:58,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 154 flow [2023-12-05 21:05:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-12-05 21:05:58,468 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7724867724867724 [2023-12-05 21:05:58,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-12-05 21:05:58,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-12-05 21:05:58,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:58,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-12-05 21:05:58,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 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:05:58,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:05:58,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:05:58,473 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2023-12-05 21:05:58,473 INFO L500 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 154 flow [2023-12-05 21:05:58,473 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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:05:58,473 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,473 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,473 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:05:58,474 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1588586371, now seen corresponding path program 1 times [2023-12-05 21:05:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776832852] [2023-12-05 21:05:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,531 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:05:58,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776832852] [2023-12-05 21:05:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776832852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198718256] [2023-12-05 21:05:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,537 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,541 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 63 [2023-12-05 21:05:58,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:05:58,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 63 [2023-12-05 21:05:58,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:58,584 INFO L124 PetriNetUnfolderBase]: 27/179 cut-off events. [2023-12-05 21:05:58,584 INFO L125 PetriNetUnfolderBase]: For 67/93 co-relation queries the response was YES. [2023-12-05 21:05:58,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 179 events. 27/179 cut-off events. For 67/93 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs, 27 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 136. Up to 57 conditions per place. [2023-12-05 21:05:58,585 INFO L140 encePairwiseOnDemand]: 61/63 looper letters, 10 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-12-05 21:05:58,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 172 flow [2023-12-05 21:05:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-12-05 21:05:58,587 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-12-05 21:05:58,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-12-05 21:05:58,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-12-05 21:05:58,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:58,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-12-05 21:05:58,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:05:58,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:05:58,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 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:05:58,589 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-12-05 21:05:58,589 INFO L500 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 172 flow [2023-12-05 21:05:58,589 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:05:58,589 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,590 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,590 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:05:58,590 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash -141149488, now seen corresponding path program 1 times [2023-12-05 21:05:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419038707] [2023-12-05 21:05:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:58,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:58,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:58,625 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:58,626 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:58,626 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:58,626 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:58,626 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:05:58,626 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:58,627 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:58,627 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:05:58,649 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:58,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 74 transitions, 176 flow [2023-12-05 21:05:58,670 INFO L124 PetriNetUnfolderBase]: 5/132 cut-off events. [2023-12-05 21:05:58,670 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:05:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 132 events. 5/132 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 263 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 114. Up to 10 conditions per place. [2023-12-05 21:05:58,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 74 transitions, 176 flow [2023-12-05 21:05:58,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 67 transitions, 162 flow [2023-12-05 21:05:58,673 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:58,675 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:58,675 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:58,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:58,676 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:05:58,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:58,676 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,676 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,676 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1094636612, now seen corresponding path program 1 times [2023-12-05 21:05:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991031128] [2023-12-05 21:05:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,704 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:05:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991031128] [2023-12-05 21:05:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991031128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093972987] [2023-12-05 21:05:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,705 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,707 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 74 [2023-12-05 21:05:58,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:05:58,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 74 [2023-12-05 21:05:58,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:58,772 INFO L124 PetriNetUnfolderBase]: 132/467 cut-off events. [2023-12-05 21:05:58,773 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-12-05 21:05:58,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 467 events. 132/467 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2693 event pairs, 132 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 320. Up to 225 conditions per place. [2023-12-05 21:05:58,777 INFO L140 encePairwiseOnDemand]: 72/74 looper letters, 14 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-12-05 21:05:58,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 190 flow [2023-12-05 21:05:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2023-12-05 21:05:58,778 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7882882882882883 [2023-12-05 21:05:58,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 175 transitions. [2023-12-05 21:05:58,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 175 transitions. [2023-12-05 21:05:58,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:58,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 175 transitions. [2023-12-05 21:05:58,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:05:58,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:05:58,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:05:58,781 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2023-12-05 21:05:58,781 INFO L500 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 190 flow [2023-12-05 21:05:58,781 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:05:58,781 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,781 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,781 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:05:58,782 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1094636611, now seen corresponding path program 1 times [2023-12-05 21:05:58,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210756260] [2023-12-05 21:05:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,841 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:05:58,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210756260] [2023-12-05 21:05:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210756260] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015710901] [2023-12-05 21:05:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,843 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,844 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 74 [2023-12-05 21:05:58,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:05:58,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 74 [2023-12-05 21:05:58,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:58,892 INFO L124 PetriNetUnfolderBase]: 83/387 cut-off events. [2023-12-05 21:05:58,892 INFO L125 PetriNetUnfolderBase]: For 215/273 co-relation queries the response was YES. [2023-12-05 21:05:58,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 387 events. 83/387 cut-off events. For 215/273 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2123 event pairs, 83 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 316. Up to 145 conditions per place. [2023-12-05 21:05:58,897 INFO L140 encePairwiseOnDemand]: 72/74 looper letters, 12 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2023-12-05 21:05:58,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 212 flow [2023-12-05 21:05:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2023-12-05 21:05:58,898 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7927927927927928 [2023-12-05 21:05:58,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 176 transitions. [2023-12-05 21:05:58,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 176 transitions. [2023-12-05 21:05:58,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:58,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 176 transitions. [2023-12-05 21:05:58,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:05:58,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:05:58,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:05:58,901 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 2 predicate places. [2023-12-05 21:05:58,901 INFO L500 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 212 flow [2023-12-05 21:05:58,901 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:05:58,901 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,901 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,901 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:05:58,901 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1493996800, now seen corresponding path program 1 times [2023-12-05 21:05:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675204443] [2023-12-05 21:05:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:58,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:58,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:58,934 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:58,934 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:58,934 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:58,934 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:58,935 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:05:58,935 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:58,935 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:58,935 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:05:58,960 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:58,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions, 210 flow [2023-12-05 21:05:58,976 INFO L124 PetriNetUnfolderBase]: 6/158 cut-off events. [2023-12-05 21:05:58,976 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:05:58,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 158 events. 6/158 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 329 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 145. Up to 12 conditions per place. [2023-12-05 21:05:58,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 85 transitions, 210 flow [2023-12-05 21:05:58,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 78 transitions, 196 flow [2023-12-05 21:05:58,980 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:58,980 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:58,980 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:58,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:58,983 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:05:58,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:58,983 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,983 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,984 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1339823268, now seen corresponding path program 1 times [2023-12-05 21:05:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869946732] [2023-12-05 21:05:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:59,007 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:05:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869946732] [2023-12-05 21:05:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869946732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:59,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:59,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170487915] [2023-12-05 21:05:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:59,008 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:59,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:59,009 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 85 [2023-12-05 21:05:59,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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:05:59,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:59,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 85 [2023-12-05 21:05:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:59,122 INFO L124 PetriNetUnfolderBase]: 356/1027 cut-off events. [2023-12-05 21:05:59,122 INFO L125 PetriNetUnfolderBase]: For 542/542 co-relation queries the response was YES. [2023-12-05 21:05:59,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 1027 events. 356/1027 cut-off events. For 542/542 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6886 event pairs, 356 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 758. Up to 545 conditions per place. [2023-12-05 21:05:59,132 INFO L140 encePairwiseOnDemand]: 83/85 looper letters, 16 selfloop transitions, 1 changer transitions 0/77 dead transitions. [2023-12-05 21:05:59,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 77 transitions, 228 flow [2023-12-05 21:05:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2023-12-05 21:05:59,133 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8 [2023-12-05 21:05:59,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 204 transitions. [2023-12-05 21:05:59,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 204 transitions. [2023-12-05 21:05:59,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:59,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 204 transitions. [2023-12-05 21:05:59,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:05:59,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:05:59,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:05:59,135 INFO L308 CegarLoopForPetriNet]: 89 programPoint places, 1 predicate places. [2023-12-05 21:05:59,136 INFO L500 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 228 flow [2023-12-05 21:05:59,136 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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:05:59,136 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:59,136 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:59,136 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:05:59,136 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:59,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1339823267, now seen corresponding path program 1 times [2023-12-05 21:05:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388832934] [2023-12-05 21:05:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:59,170 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:05:59,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:59,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388832934] [2023-12-05 21:05:59,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388832934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:59,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:59,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:59,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589754228] [2023-12-05 21:05:59,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:59,171 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:59,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:59,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:59,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:59,172 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2023-12-05 21:05:59,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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:05:59,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:59,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2023-12-05 21:05:59,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:59,278 INFO L124 PetriNetUnfolderBase]: 227/835 cut-off events. [2023-12-05 21:05:59,279 INFO L125 PetriNetUnfolderBase]: For 655/777 co-relation queries the response was YES. [2023-12-05 21:05:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 835 events. 227/835 cut-off events. For 655/777 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5511 event pairs, 227 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 742. Up to 353 conditions per place. [2023-12-05 21:05:59,286 INFO L140 encePairwiseOnDemand]: 83/85 looper letters, 14 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2023-12-05 21:05:59,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 76 transitions, 254 flow [2023-12-05 21:05:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2023-12-05 21:05:59,288 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2023-12-05 21:05:59,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 205 transitions. [2023-12-05 21:05:59,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions. [2023-12-05 21:05:59,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:59,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions. [2023-12-05 21:05:59,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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:05:59,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:05:59,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:05:59,290 INFO L308 CegarLoopForPetriNet]: 89 programPoint places, 2 predicate places. [2023-12-05 21:05:59,290 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 254 flow [2023-12-05 21:05:59,290 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 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:05:59,290 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:59,290 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:59,290 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:05:59,290 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:59,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1794603697, now seen corresponding path program 1 times [2023-12-05 21:05:59,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:59,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478255864] [2023-12-05 21:05:59,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:59,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:59,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:59,356 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:59,356 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:59,356 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:59,356 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:59,357 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:05:59,357 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:59,357 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:59,357 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:05:59,378 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:59,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 96 transitions, 246 flow [2023-12-05 21:05:59,391 INFO L124 PetriNetUnfolderBase]: 7/184 cut-off events. [2023-12-05 21:05:59,391 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:05:59,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 184 events. 7/184 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 382 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 177. Up to 14 conditions per place. [2023-12-05 21:05:59,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 96 transitions, 246 flow [2023-12-05 21:05:59,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 89 transitions, 232 flow [2023-12-05 21:05:59,393 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:59,394 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:59,394 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:59,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:59,395 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:05:59,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:59,395 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:59,395 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:59,395 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:59,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1970820956, now seen corresponding path program 1 times [2023-12-05 21:05:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484682818] [2023-12-05 21:05:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:59,426 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:05:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484682818] [2023-12-05 21:05:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484682818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796646287] [2023-12-05 21:05:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:59,428 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:59,429 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96 [2023-12-05 21:05:59,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:05:59,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:59,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96 [2023-12-05 21:05:59,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:59,678 INFO L124 PetriNetUnfolderBase]: 900/2243 cut-off events. [2023-12-05 21:05:59,678 INFO L125 PetriNetUnfolderBase]: For 1662/1662 co-relation queries the response was YES. [2023-12-05 21:05:59,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 2243 events. 900/2243 cut-off events. For 1662/1662 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16821 event pairs, 900 based on Foata normal form. 0/1959 useless extension candidates. Maximal degree in co-relation 1750. Up to 1281 conditions per place. [2023-12-05 21:05:59,704 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 18 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:05:59,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 88 transitions, 268 flow [2023-12-05 21:05:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2023-12-05 21:05:59,706 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8090277777777778 [2023-12-05 21:05:59,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 233 transitions. [2023-12-05 21:05:59,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 233 transitions. [2023-12-05 21:05:59,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:59,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 233 transitions. [2023-12-05 21:05:59,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:05:59,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:59,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:59,708 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2023-12-05 21:05:59,708 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 268 flow [2023-12-05 21:05:59,708 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:05:59,708 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:59,708 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:59,708 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:05:59,708 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:59,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:59,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1970820957, now seen corresponding path program 1 times [2023-12-05 21:05:59,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:59,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75871729] [2023-12-05 21:05:59,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:59,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:59,827 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:05:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75871729] [2023-12-05 21:05:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75871729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:59,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093760592] [2023-12-05 21:05:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:59,829 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:59,829 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2023-12-05 21:05:59,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 88 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:05:59,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:59,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2023-12-05 21:05:59,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:00,063 INFO L124 PetriNetUnfolderBase]: 579/1795 cut-off events. [2023-12-05 21:06:00,063 INFO L125 PetriNetUnfolderBase]: For 1887/2137 co-relation queries the response was YES. [2023-12-05 21:06:00,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 1795 events. 579/1795 cut-off events. For 1887/2137 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 13758 event pairs, 579 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 1718. Up to 833 conditions per place. [2023-12-05 21:06:00,087 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 16 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-12-05 21:06:00,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 87 transitions, 298 flow [2023-12-05 21:06:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2023-12-05 21:06:00,089 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8125 [2023-12-05 21:06:00,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2023-12-05 21:06:00,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2023-12-05 21:06:00,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:00,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2023-12-05 21:06:00,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 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:06:00,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:00,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:00,090 INFO L308 CegarLoopForPetriNet]: 102 programPoint places, 2 predicate places. [2023-12-05 21:06:00,091 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 87 transitions, 298 flow [2023-12-05 21:06:00,091 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:06:00,091 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:00,091 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 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:06:00,091 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:06:00,091 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:00,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash 298751112, now seen corresponding path program 1 times [2023-12-05 21:06:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:00,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317264889] [2023-12-05 21:06:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:00,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:00,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:00,125 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:00,125 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:00,125 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:00,125 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:00,125 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:06:00,125 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:00,127 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:00,127 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-12-05 21:06:00,156 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:00,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 107 transitions, 284 flow [2023-12-05 21:06:00,169 INFO L124 PetriNetUnfolderBase]: 8/210 cut-off events. [2023-12-05 21:06:00,169 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:06:00,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 210 events. 8/210 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 475 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 210. Up to 16 conditions per place. [2023-12-05 21:06:00,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 107 transitions, 284 flow [2023-12-05 21:06:00,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 100 transitions, 270 flow [2023-12-05 21:06:00,173 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:00,173 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:00,173 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:00,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:00,174 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:06:00,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:00,174 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:00,174 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:00,174 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:00,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash 247361468, now seen corresponding path program 1 times [2023-12-05 21:06:00,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:00,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848376407] [2023-12-05 21:06:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:00,204 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:06:00,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:00,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848376407] [2023-12-05 21:06:00,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848376407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:00,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:00,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:00,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413870938] [2023-12-05 21:06:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:00,205 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:00,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:00,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:00,206 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2023-12-05 21:06:00,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:06:00,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:00,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2023-12-05 21:06:00,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:00,762 INFO L124 PetriNetUnfolderBase]: 2180/4867 cut-off events. [2023-12-05 21:06:00,762 INFO L125 PetriNetUnfolderBase]: For 4734/4734 co-relation queries the response was YES. [2023-12-05 21:06:00,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8721 conditions, 4867 events. 2180/4867 cut-off events. For 4734/4734 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 39705 event pairs, 2180 based on Foata normal form. 0/4295 useless extension candidates. Maximal degree in co-relation 3958. Up to 2945 conditions per place. [2023-12-05 21:06:00,809 INFO L140 encePairwiseOnDemand]: 105/107 looper letters, 20 selfloop transitions, 1 changer transitions 0/99 dead transitions. [2023-12-05 21:06:00,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 99 transitions, 310 flow [2023-12-05 21:06:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-12-05 21:06:00,811 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8161993769470405 [2023-12-05 21:06:00,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-12-05 21:06:00,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-12-05 21:06:00,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:00,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-12-05 21:06:00,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:06:00,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:06:00,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:06:00,812 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places. [2023-12-05 21:06:00,813 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 310 flow [2023-12-05 21:06:00,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:06:00,813 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:00,813 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:00,813 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 21:06:00,813 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:00,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 247361469, now seen corresponding path program 1 times [2023-12-05 21:06:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264264301] [2023-12-05 21:06:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:00,841 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:06:00,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:00,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264264301] [2023-12-05 21:06:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264264301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:00,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413737355] [2023-12-05 21:06:00,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:00,842 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:00,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:00,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:00,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:00,843 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2023-12-05 21:06:00,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:06:00,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:00,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2023-12-05 21:06:00,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:01,441 INFO L124 PetriNetUnfolderBase]: 1411/3843 cut-off events. [2023-12-05 21:06:01,441 INFO L125 PetriNetUnfolderBase]: For 5183/5689 co-relation queries the response was YES. [2023-12-05 21:06:01,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8598 conditions, 3843 events. 1411/3843 cut-off events. For 5183/5689 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 32328 event pairs, 1411 based on Foata normal form. 0/3653 useless extension candidates. Maximal degree in co-relation 3894. Up to 1921 conditions per place. [2023-12-05 21:06:01,479 INFO L140 encePairwiseOnDemand]: 105/107 looper letters, 18 selfloop transitions, 1 changer transitions 0/98 dead transitions. [2023-12-05 21:06:01,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 98 transitions, 344 flow [2023-12-05 21:06:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-12-05 21:06:01,481 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8193146417445483 [2023-12-05 21:06:01,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-12-05 21:06:01,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-12-05 21:06:01,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:01,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-12-05 21:06:01,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:06:01,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:06:01,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:06:01,483 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, 2 predicate places. [2023-12-05 21:06:01,483 INFO L500 AbstractCegarLoop]: Abstraction has has 117 places, 98 transitions, 344 flow [2023-12-05 21:06:01,483 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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:06:01,483 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:01,483 INFO L233 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 7, 7, 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:06:01,483 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-05 21:06:01,483 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:01,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1144881138, now seen corresponding path program 1 times [2023-12-05 21:06:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174206213] [2023-12-05 21:06:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:01,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:01,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:01,519 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:01,519 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:01,519 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:01,519 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:01,519 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-05 21:06:01,519 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:01,521 WARN L227 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:01,521 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-12-05 21:06:01,548 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:01,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 118 transitions, 324 flow [2023-12-05 21:06:01,567 INFO L124 PetriNetUnfolderBase]: 9/236 cut-off events. [2023-12-05 21:06:01,567 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-12-05 21:06:01,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 236 events. 9/236 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 548 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 244. Up to 18 conditions per place. [2023-12-05 21:06:01,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 118 transitions, 324 flow [2023-12-05 21:06:01,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 111 transitions, 310 flow [2023-12-05 21:06:01,572 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:01,572 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:01,572 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:01,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:01,573 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:06:01,574 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:01,574 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:01,574 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:01,574 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:01,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2079732860, now seen corresponding path program 1 times [2023-12-05 21:06:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:01,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647955571] [2023-12-05 21:06:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:01,605 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:06:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647955571] [2023-12-05 21:06:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647955571] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464592789] [2023-12-05 21:06:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:01,607 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:01,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:01,609 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2023-12-05 21:06:01,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:06:01,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:01,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2023-12-05 21:06:01,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:03,288 INFO L124 PetriNetUnfolderBase]: 5124/10499 cut-off events. [2023-12-05 21:06:03,288 INFO L125 PetriNetUnfolderBase]: For 12798/12798 co-relation queries the response was YES. [2023-12-05 21:06:03,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19218 conditions, 10499 events. 5124/10499 cut-off events. For 12798/12798 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 90306 event pairs, 5124 based on Foata normal form. 0/9351 useless extension candidates. Maximal degree in co-relation 8822. Up to 6657 conditions per place. [2023-12-05 21:06:03,399 INFO L140 encePairwiseOnDemand]: 116/118 looper letters, 22 selfloop transitions, 1 changer transitions 0/110 dead transitions. [2023-12-05 21:06:03,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 110 transitions, 354 flow [2023-12-05 21:06:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-12-05 21:06:03,400 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8220338983050848 [2023-12-05 21:06:03,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-12-05 21:06:03,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-12-05 21:06:03,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:03,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-12-05 21:06:03,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:06:03,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:06:03,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:06:03,403 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2023-12-05 21:06:03,403 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 110 transitions, 354 flow [2023-12-05 21:06:03,403 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:06:03,403 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:03,403 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:03,403 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-05 21:06:03,403 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:03,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2079732861, now seen corresponding path program 1 times [2023-12-05 21:06:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:03,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976386749] [2023-12-05 21:06:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:03,432 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:06:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976386749] [2023-12-05 21:06:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976386749] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:03,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538216532] [2023-12-05 21:06:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:03,433 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:03,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:03,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:03,433 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 118 [2023-12-05 21:06:03,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 110 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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:06:03,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:03,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 118 [2023-12-05 21:06:03,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:04,824 INFO L124 PetriNetUnfolderBase]: 3331/8195 cut-off events. [2023-12-05 21:06:04,824 INFO L125 PetriNetUnfolderBase]: For 13695/14713 co-relation queries the response was YES. [2023-12-05 21:06:04,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18967 conditions, 8195 events. 3331/8195 cut-off events. For 13695/14713 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 74879 event pairs, 3331 based on Foata normal form. 0/7813 useless extension candidates. Maximal degree in co-relation 8694. Up to 4353 conditions per place. [2023-12-05 21:06:04,901 INFO L140 encePairwiseOnDemand]: 116/118 looper letters, 20 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-12-05 21:06:04,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 109 transitions, 392 flow [2023-12-05 21:06:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-12-05 21:06:04,903 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8248587570621468 [2023-12-05 21:06:04,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-12-05 21:06:04,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-12-05 21:06:04,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:04,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-12-05 21:06:04,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:06:04,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:06:04,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:06:04,905 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places. [2023-12-05 21:06:04,905 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 392 flow [2023-12-05 21:06:04,905 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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:06:04,905 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:04,905 INFO L233 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 8, 8, 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:06:04,905 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-05 21:06:04,905 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:04,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash 973808892, now seen corresponding path program 1 times [2023-12-05 21:06:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69516945] [2023-12-05 21:06:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:04,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:04,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:04,930 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:04,930 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:04,930 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:04,930 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:04,930 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-05 21:06:04,930 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:04,931 WARN L227 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:04,931 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2023-12-05 21:06:04,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:04,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 129 transitions, 366 flow [2023-12-05 21:06:04,971 INFO L124 PetriNetUnfolderBase]: 10/262 cut-off events. [2023-12-05 21:06:04,971 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-12-05 21:06:04,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 262 events. 10/262 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 601 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 279. Up to 20 conditions per place. [2023-12-05 21:06:04,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 129 transitions, 366 flow [2023-12-05 21:06:04,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 122 transitions, 352 flow [2023-12-05 21:06:04,973 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:04,973 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:04,973 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:04,974 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:04,974 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:06:04,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:04,974 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:04,974 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:04,975 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:04,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1121999460, now seen corresponding path program 1 times [2023-12-05 21:06:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930452162] [2023-12-05 21:06:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:04,991 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:06:04,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930452162] [2023-12-05 21:06:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930452162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553116927] [2023-12-05 21:06:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:04,992 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:04,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:04,993 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 129 [2023-12-05 21:06:04,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 122 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:06:04,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:04,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 129 [2023-12-05 21:06:04,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:08,553 INFO L124 PetriNetUnfolderBase]: 11780/22531 cut-off events. [2023-12-05 21:06:08,555 INFO L125 PetriNetUnfolderBase]: For 33278/33278 co-relation queries the response was YES. [2023-12-05 21:06:08,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42003 conditions, 22531 events. 11780/22531 cut-off events. For 33278/33278 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 203726 event pairs, 11780 based on Foata normal form. 0/20231 useless extension candidates. Maximal degree in co-relation 19446. Up to 14849 conditions per place. [2023-12-05 21:06:08,921 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 24 selfloop transitions, 1 changer transitions 0/121 dead transitions. [2023-12-05 21:06:08,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 121 transitions, 400 flow [2023-12-05 21:06:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-12-05 21:06:08,923 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8268733850129198 [2023-12-05 21:06:08,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-12-05 21:06:08,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-12-05 21:06:08,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:08,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-12-05 21:06:08,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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:06:08,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:06:08,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:06:08,927 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 1 predicate places. [2023-12-05 21:06:08,927 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 400 flow [2023-12-05 21:06:08,927 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:06:08,928 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:08,928 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:08,928 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-05 21:06:08,928 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:08,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1121999459, now seen corresponding path program 1 times [2023-12-05 21:06:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105268603] [2023-12-05 21:06:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:08,998 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:06:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105268603] [2023-12-05 21:06:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105268603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:08,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639367169] [2023-12-05 21:06:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:08,999 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:08,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:09,000 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 129 [2023-12-05 21:06:09,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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:06:09,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:09,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 129 [2023-12-05 21:06:09,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:11,851 INFO L124 PetriNetUnfolderBase]: 7683/17411 cut-off events. [2023-12-05 21:06:11,852 INFO L125 PetriNetUnfolderBase]: For 35071/37113 co-relation queries the response was YES. [2023-12-05 21:06:11,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41496 conditions, 17411 events. 7683/17411 cut-off events. For 35071/37113 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 169029 event pairs, 7683 based on Foata normal form. 0/16645 useless extension candidates. Maximal degree in co-relation 19190. Up to 9729 conditions per place. [2023-12-05 21:06:12,297 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 22 selfloop transitions, 1 changer transitions 0/120 dead transitions. [2023-12-05 21:06:12,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 120 transitions, 442 flow [2023-12-05 21:06:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-12-05 21:06:12,300 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8294573643410853 [2023-12-05 21:06:12,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-12-05 21:06:12,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-12-05 21:06:12,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:12,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-12-05 21:06:12,301 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:06:12,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:06:12,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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:06:12,302 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 2 predicate places. [2023-12-05 21:06:12,302 INFO L500 AbstractCegarLoop]: Abstraction has has 143 places, 120 transitions, 442 flow [2023-12-05 21:06:12,303 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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:06:12,303 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:12,303 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 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:06:12,303 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-05 21:06:12,303 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:12,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1586067085, now seen corresponding path program 1 times [2023-12-05 21:06:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:12,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150624859] [2023-12-05 21:06:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:12,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:12,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:12,337 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:12,337 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:12,337 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:12,337 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:12,338 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-05 21:06:12,338 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:12,338 WARN L227 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:12,338 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2023-12-05 21:06:12,365 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:12,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 140 transitions, 410 flow [2023-12-05 21:06:12,384 INFO L124 PetriNetUnfolderBase]: 11/288 cut-off events. [2023-12-05 21:06:12,384 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-12-05 21:06:12,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 288 events. 11/288 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 666 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 315. Up to 22 conditions per place. [2023-12-05 21:06:12,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 140 transitions, 410 flow [2023-12-05 21:06:12,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 133 transitions, 396 flow [2023-12-05 21:06:12,387 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:12,387 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:12,387 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:12,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:12,389 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:06:12,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:12,389 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:12,389 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:12,389 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:12,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash -767900900, now seen corresponding path program 1 times [2023-12-05 21:06:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936304928] [2023-12-05 21:06:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:12,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:06:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936304928] [2023-12-05 21:06:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936304928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971211942] [2023-12-05 21:06:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:12,409 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:12,409 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 140 [2023-12-05 21:06:12,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 133 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:06:12,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:12,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 140 [2023-12-05 21:06:12,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:20,649 INFO L124 PetriNetUnfolderBase]: 26628/48131 cut-off events. [2023-12-05 21:06:20,650 INFO L125 PetriNetUnfolderBase]: For 83966/83966 co-relation queries the response was YES. [2023-12-05 21:06:21,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91156 conditions, 48131 events. 26628/48131 cut-off events. For 83966/83966 co-relation queries the response was YES. Maximal size of possible extension queue 1647. Compared 450513 event pairs, 26628 based on Foata normal form. 0/43527 useless extension candidates. Maximal degree in co-relation 42486. Up to 32769 conditions per place. [2023-12-05 21:06:21,693 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 26 selfloop transitions, 1 changer transitions 0/132 dead transitions. [2023-12-05 21:06:21,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 132 transitions, 448 flow [2023-12-05 21:06:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-12-05 21:06:21,695 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.830952380952381 [2023-12-05 21:06:21,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-12-05 21:06:21,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-12-05 21:06:21,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:21,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-12-05 21:06:21,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:06:21,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:06:21,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:06:21,697 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, 1 predicate places. [2023-12-05 21:06:21,697 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 132 transitions, 448 flow [2023-12-05 21:06:21,698 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:06:21,698 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:21,698 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:21,698 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-05 21:06:21,698 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:21,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash -767900899, now seen corresponding path program 1 times [2023-12-05 21:06:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:21,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319431134] [2023-12-05 21:06:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:21,724 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:06:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319431134] [2023-12-05 21:06:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319431134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:21,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070570959] [2023-12-05 21:06:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:21,725 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:21,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:21,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:21,725 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2023-12-05 21:06:21,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 132 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:21,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:21,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2023-12-05 21:06:21,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:28,008 INFO L124 PetriNetUnfolderBase]: 17411/36867 cut-off events. [2023-12-05 21:06:28,008 INFO L125 PetriNetUnfolderBase]: For 87551/91641 co-relation queries the response was YES. [2023-12-05 21:06:28,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90137 conditions, 36867 events. 17411/36867 cut-off events. For 87551/91641 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 378125 event pairs, 17411 based on Foata normal form. 0/35333 useless extension candidates. Maximal degree in co-relation 41974. Up to 21505 conditions per place. [2023-12-05 21:06:28,835 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 24 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2023-12-05 21:06:28,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 131 transitions, 494 flow [2023-12-05 21:06:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-12-05 21:06:28,846 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-12-05 21:06:28,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-12-05 21:06:28,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-12-05 21:06:28,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:28,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-12-05 21:06:28,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:06:28,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:06:28,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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:06:28,858 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, 2 predicate places. [2023-12-05 21:06:28,858 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 131 transitions, 494 flow [2023-12-05 21:06:28,858 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:28,858 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:28,859 INFO L233 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 10, 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:06:28,859 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-05 21:06:28,859 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:28,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:28,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1988303580, now seen corresponding path program 1 times [2023-12-05 21:06:28,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:28,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758107615] [2023-12-05 21:06:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:28,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:28,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:28,909 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:28,909 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:28,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:28,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:28,910 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-05 21:06:28,910 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:28,911 WARN L227 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:28,911 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2023-12-05 21:06:29,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:29,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 151 transitions, 456 flow [2023-12-05 21:06:29,073 INFO L124 PetriNetUnfolderBase]: 12/314 cut-off events. [2023-12-05 21:06:29,073 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-12-05 21:06:29,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 314 events. 12/314 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 731 event pairs, 0 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 352. Up to 24 conditions per place. [2023-12-05 21:06:29,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 151 transitions, 456 flow [2023-12-05 21:06:29,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 144 transitions, 442 flow [2023-12-05 21:06:29,076 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:29,076 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:29,076 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:29,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:29,077 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:06:29,077 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:29,077 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:29,078 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:29,078 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:29,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1152938756, now seen corresponding path program 1 times [2023-12-05 21:06:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:29,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109815699] [2023-12-05 21:06:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:29,095 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:06:29,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:29,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109815699] [2023-12-05 21:06:29,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109815699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:29,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:29,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301798481] [2023-12-05 21:06:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:29,096 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:29,097 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 151 [2023-12-05 21:06:29,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 144 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:29,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:29,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 151 [2023-12-05 21:06:29,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:49,874 INFO L124 PetriNetUnfolderBase]: 59396/102403 cut-off events. [2023-12-05 21:06:49,874 INFO L125 PetriNetUnfolderBase]: For 206846/206846 co-relation queries the response was YES. [2023-12-05 21:06:51,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196629 conditions, 102403 events. 59396/102403 cut-off events. For 206846/206846 co-relation queries the response was YES. Maximal size of possible extension queue 3192. Compared 994036 event pairs, 59396 based on Foata normal form. 0/93191 useless extension candidates. Maximal degree in co-relation 92150. Up to 71681 conditions per place. [2023-12-05 21:06:52,744 INFO L140 encePairwiseOnDemand]: 149/151 looper letters, 28 selfloop transitions, 1 changer transitions 0/143 dead transitions. [2023-12-05 21:06:52,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 143 transitions, 498 flow [2023-12-05 21:06:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-12-05 21:06:52,746 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8344370860927153 [2023-12-05 21:06:52,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-12-05 21:06:52,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-12-05 21:06:52,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:52,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-12-05 21:06:52,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:06:52,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 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:06:52,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 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:06:52,749 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, 1 predicate places. [2023-12-05 21:06:52,749 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 143 transitions, 498 flow [2023-12-05 21:06:52,749 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:52,749 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:52,749 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:52,749 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-05 21:06:52,749 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:52,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1152938755, now seen corresponding path program 1 times [2023-12-05 21:06:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675427164] [2023-12-05 21:06:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:52,790 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:06:52,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:52,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675427164] [2023-12-05 21:06:52,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675427164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:52,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:52,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004699775] [2023-12-05 21:06:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:52,791 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:52,792 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 151 [2023-12-05 21:06:52,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 143 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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:06:52,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:52,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 151 [2023-12-05 21:06:52,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:06,753 INFO L124 PetriNetUnfolderBase]: 38915/77827 cut-off events. [2023-12-05 21:07:06,753 INFO L125 PetriNetUnfolderBase]: For 214015/222201 co-relation queries the response was YES. [2023-12-05 21:07:08,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194586 conditions, 77827 events. 38915/77827 cut-off events. For 214015/222201 co-relation queries the response was YES. Maximal size of possible extension queue 2440. Compared 834845 event pairs, 38915 based on Foata normal form. 0/74757 useless extension candidates. Maximal degree in co-relation 91126. Up to 47105 conditions per place. [2023-12-05 21:07:09,018 INFO L140 encePairwiseOnDemand]: 149/151 looper letters, 26 selfloop transitions, 1 changer transitions 0/142 dead transitions. [2023-12-05 21:07:09,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 142 transitions, 548 flow [2023-12-05 21:07:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-12-05 21:07:09,020 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8366445916114791 [2023-12-05 21:07:09,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-12-05 21:07:09,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-12-05 21:07:09,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:09,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-12-05 21:07:09,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 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:07:09,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 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:07:09,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 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:07:09,022 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, 2 predicate places. [2023-12-05 21:07:09,022 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 142 transitions, 548 flow [2023-12-05 21:07:09,022 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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:07:09,022 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:09,022 INFO L233 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 11, 11, 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:07:09,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-05 21:07:09,023 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:07:09,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash -373656500, now seen corresponding path program 1 times [2023-12-05 21:07:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896178272] [2023-12-05 21:07:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:07:09,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:07:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:07:09,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:07:09,103 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:07:09,103 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:07:09,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:07:09,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:07:09,103 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-05 21:07:09,103 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:07:09,113 WARN L227 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:07:09,113 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2023-12-05 21:07:09,146 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:07:09,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 162 transitions, 504 flow [2023-12-05 21:07:09,275 INFO L124 PetriNetUnfolderBase]: 13/340 cut-off events. [2023-12-05 21:07:09,276 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-12-05 21:07:09,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 340 events. 13/340 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 803 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 390. Up to 26 conditions per place. [2023-12-05 21:07:09,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 162 transitions, 504 flow [2023-12-05 21:07:09,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 155 transitions, 490 flow [2023-12-05 21:07:09,279 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:07:09,279 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;@69e14b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:07:09,279 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:07:09,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:07:09,280 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-12-05 21:07:09,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:09,280 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:09,280 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:09,280 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:07:09,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2017854268, now seen corresponding path program 1 times [2023-12-05 21:07:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:09,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031505859] [2023-12-05 21:07:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:09,298 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:07:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031505859] [2023-12-05 21:07:09,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031505859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:09,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:09,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519404577] [2023-12-05 21:07:09,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:09,298 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:09,299 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 162 [2023-12-05 21:07:09,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 155 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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:07:09,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:09,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 162 [2023-12-05 21:07:09,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:56,569 INFO L124 PetriNetUnfolderBase]: 131076/217091 cut-off events. [2023-12-05 21:07:56,569 INFO L125 PetriNetUnfolderBase]: For 499710/499710 co-relation queries the response was YES.