/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_61-invariant_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:16:58,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:16:58,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:16:58,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:16:58,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:16:58,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:16:58,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:16:58,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:16:58,739 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:16:58,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:16:58,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:16:58,743 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:16:58,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:16:58,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:16:58,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:16:58,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:16:58,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:16:58,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:16:58,746 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:16:58,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:16:58,746 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:16:58,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:16:58,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:16:58,747 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:16:58,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:16:58,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:58,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:16:58,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:16:58,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:16:58,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:16:58,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:16:58,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:16:58,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:16:58,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:16:58,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:16:59,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:16:59,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:16:59,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:16:59,030 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:16:59,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_61-invariant_racing.i [2023-12-05 21:17:00,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:17:00,435 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:17:00,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_61-invariant_racing.i [2023-12-05 21:17:00,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe74d36a/12598ba1646646e2a2fd974fd230ff5b/FLAG93759a96d [2023-12-05 21:17:00,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe74d36a/12598ba1646646e2a2fd974fd230ff5b [2023-12-05 21:17:00,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:17:00,473 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:17:00,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:17:00,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:17:00,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:17:00,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0cdf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00, skipping insertion in model container [2023-12-05 21:17:00,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,528 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:17:00,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:17:00,827 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:17:00,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:17:00,927 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:17:00,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00 WrapperNode [2023-12-05 21:17:00,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:17:00,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:17:00,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:17:00,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:17:00,934 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:17:00" (1/1) ... [2023-12-05 21:17:00,959 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:17:00" (1/1) ... [2023-12-05 21:17:00,977 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2023-12-05 21:17:00,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:17:00,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:17:00,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:17:00,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:17:00,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:01,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:17:01,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:17:01,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:17:01,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:17:01,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:01,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:17:01,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:01,048 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:17:01,067 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:17:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:17:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:17:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:17:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:17:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:17:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:17:01,079 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:17:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:17:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:17:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:17:01,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:17:01,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:17:01,081 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:17:01,198 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:17:01,200 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:17:01,418 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:17:01,460 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:17:01,460 INFO L309 CfgBuilder]: Removed 16 assume(true) statements. [2023-12-05 21:17:01,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:17:01 BoogieIcfgContainer [2023-12-05 21:17:01,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:17:01,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:17:01,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:17:01,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:17:01,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:17:00" (1/3) ... [2023-12-05 21:17:01,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a4ec52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:17:01, skipping insertion in model container [2023-12-05 21:17:01,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (2/3) ... [2023-12-05 21:17:01,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a4ec52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:17:01, skipping insertion in model container [2023-12-05 21:17:01,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:17:01" (3/3) ... [2023-12-05 21:17:01,471 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2023-12-05 21:17:01,487 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:17:01,487 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:17:01,488 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:17:01,546 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:17:01,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 150 transitions, 307 flow [2023-12-05 21:17:01,687 INFO L124 PetriNetUnfolderBase]: 32/222 cut-off events. [2023-12-05 21:17:01,688 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:17:01,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 222 events. 32/222 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 773 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 118. Up to 6 conditions per place. [2023-12-05 21:17:01,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 150 transitions, 307 flow [2023-12-05 21:17:01,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 150 transitions, 307 flow [2023-12-05 21:17:01,721 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:01,729 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;@ee39d20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:01,730 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:01,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:01,746 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-12-05 21:17:01,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:01,746 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:01,747 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:01,748 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:01,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 330832510, now seen corresponding path program 1 times [2023-12-05 21:17:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572377232] [2023-12-05 21:17:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:01,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:02,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572377232] [2023-12-05 21:17:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572377232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:02,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:02,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77778206] [2023-12-05 21:17:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:02,070 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:02,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:02,121 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 150 [2023-12-05 21:17:02,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 150 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:02,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 150 [2023-12-05 21:17:02,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:02,355 INFO L124 PetriNetUnfolderBase]: 164/790 cut-off events. [2023-12-05 21:17:02,356 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:17:02,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 790 events. 164/790 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4861 event pairs, 120 based on Foata normal form. 160/886 useless extension candidates. Maximal degree in co-relation 1028. Up to 277 conditions per place. [2023-12-05 21:17:02,365 INFO L140 encePairwiseOnDemand]: 128/150 looper letters, 40 selfloop transitions, 2 changer transitions 2/137 dead transitions. [2023-12-05 21:17:02,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 137 transitions, 369 flow [2023-12-05 21:17:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-12-05 21:17:02,382 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2023-12-05 21:17:02,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-12-05 21:17:02,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-12-05 21:17:02,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:02,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-12-05 21:17:02,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,400 INFO L308 CegarLoopForPetriNet]: 133 programPoint places, -3 predicate places. [2023-12-05 21:17:02,401 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 137 transitions, 369 flow [2023-12-05 21:17:02,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,401 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:02,401 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:02,401 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:17:02,401 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:02,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash 330832511, now seen corresponding path program 1 times [2023-12-05 21:17:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:02,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220661604] [2023-12-05 21:17:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:02,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:02,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220661604] [2023-12-05 21:17:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220661604] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:02,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111327782] [2023-12-05 21:17:02,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:02,595 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:02,598 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 150 [2023-12-05 21:17:02,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 137 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:02,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 150 [2023-12-05 21:17:02,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:02,829 INFO L124 PetriNetUnfolderBase]: 202/956 cut-off events. [2023-12-05 21:17:02,830 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2023-12-05 21:17:02,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 956 events. 202/956 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5970 event pairs, 10 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1704. Up to 362 conditions per place. [2023-12-05 21:17:02,837 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 63 selfloop transitions, 4 changer transitions 4/159 dead transitions. [2023-12-05 21:17:02,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 159 transitions, 597 flow [2023-12-05 21:17:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:17:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:17:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-12-05 21:17:02,840 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.705 [2023-12-05 21:17:02,840 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-12-05 21:17:02,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-12-05 21:17:02,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:02,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-12-05 21:17:02,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,846 INFO L308 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2023-12-05 21:17:02,846 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 597 flow [2023-12-05 21:17:02,846 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,847 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:02,848 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:02,848 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:17:02,848 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:02,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash -525909908, now seen corresponding path program 1 times [2023-12-05 21:17:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109613091] [2023-12-05 21:17:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:03,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109613091] [2023-12-05 21:17:03,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109613091] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:03,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949126677] [2023-12-05 21:17:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:03,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:03,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:03,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:17:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:03,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:17:03,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:03,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:03,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:03,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949126677] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:03,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:03,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:17:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656305842] [2023-12-05 21:17:03,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:03,504 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:17:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:03,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:17:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:17:03,508 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 150 [2023-12-05 21:17:03,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 597 flow. Second operand has 11 states, 11 states have (on average 91.63636363636364) internal successors, (1008), 11 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:03,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 150 [2023-12-05 21:17:03,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:03,694 INFO L124 PetriNetUnfolderBase]: 51/246 cut-off events. [2023-12-05 21:17:03,694 INFO L125 PetriNetUnfolderBase]: For 151/162 co-relation queries the response was YES. [2023-12-05 21:17:03,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 246 events. 51/246 cut-off events. For 151/162 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 902 event pairs, 4 based on Foata normal form. 6/250 useless extension candidates. Maximal degree in co-relation 497. Up to 74 conditions per place. [2023-12-05 21:17:03,696 INFO L140 encePairwiseOnDemand]: 143/150 looper letters, 50 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2023-12-05 21:17:03,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 528 flow [2023-12-05 21:17:03,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:17:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:17:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 680 transitions. [2023-12-05 21:17:03,699 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2023-12-05 21:17:03,699 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 680 transitions. [2023-12-05 21:17:03,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 680 transitions. [2023-12-05 21:17:03,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:03,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 680 transitions. [2023-12-05 21:17:03,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,704 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,705 INFO L308 CegarLoopForPetriNet]: 133 programPoint places, -49 predicate places. [2023-12-05 21:17:03,706 INFO L500 AbstractCegarLoop]: Abstraction has has 84 places, 103 transitions, 528 flow [2023-12-05 21:17:03,707 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.63636363636364) internal successors, (1008), 11 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,707 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:03,707 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:03,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-05 21:17:03,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:03,917 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:03,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 876662467, now seen corresponding path program 1 times [2023-12-05 21:17:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876433757] [2023-12-05 21:17:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:03,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:17:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:03,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:17:03,966 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:17:03,968 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:17:03,971 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:17:03,972 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:17:03,972 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:17:03,972 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:17:03,972 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:17:03,973 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:17:03,974 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:17:03,974 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:17:04,030 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:17:04,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 193 transitions, 402 flow [2023-12-05 21:17:04,064 INFO L124 PetriNetUnfolderBase]: 54/365 cut-off events. [2023-12-05 21:17:04,064 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:17:04,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 365 events. 54/365 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1468 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 224. Up to 9 conditions per place. [2023-12-05 21:17:04,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 193 transitions, 402 flow [2023-12-05 21:17:04,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 193 transitions, 402 flow [2023-12-05 21:17:04,071 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:04,072 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;@ee39d20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:04,072 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:04,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:04,075 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-12-05 21:17:04,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:04,075 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:04,075 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:04,076 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:04,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash -25863809, now seen corresponding path program 1 times [2023-12-05 21:17:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261951737] [2023-12-05 21:17:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:04,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:04,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261951737] [2023-12-05 21:17:04,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261951737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:04,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:04,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077430758] [2023-12-05 21:17:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:04,122 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:04,124 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 193 [2023-12-05 21:17:04,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 193 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:04,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:04,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 193 [2023-12-05 21:17:04,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:05,565 INFO L124 PetriNetUnfolderBase]: 3819/10676 cut-off events. [2023-12-05 21:17:05,565 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-12-05 21:17:05,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16612 conditions, 10676 events. 3819/10676 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 105855 event pairs, 2910 based on Foata normal form. 2570/12503 useless extension candidates. Maximal degree in co-relation 1756. Up to 4705 conditions per place. [2023-12-05 21:17:05,650 INFO L140 encePairwiseOnDemand]: 165/193 looper letters, 64 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2023-12-05 21:17:05,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 184 transitions, 516 flow [2023-12-05 21:17:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-12-05 21:17:05,652 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8013816925734024 [2023-12-05 21:17:05,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-12-05 21:17:05,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-12-05 21:17:05,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:05,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-12-05 21:17:05,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:05,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:05,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:05,658 INFO L308 CegarLoopForPetriNet]: 170 programPoint places, -3 predicate places. [2023-12-05 21:17:05,658 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 184 transitions, 516 flow [2023-12-05 21:17:05,659 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:05,659 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:05,659 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:05,659 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:17:05,659 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:05,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash -25863808, now seen corresponding path program 1 times [2023-12-05 21:17:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:05,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70980672] [2023-12-05 21:17:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:05,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70980672] [2023-12-05 21:17:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70980672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:05,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:05,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958760386] [2023-12-05 21:17:05,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:05,735 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:05,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:05,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:05,736 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 193 [2023-12-05 21:17:05,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 184 transitions, 516 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:05,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:05,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 193 [2023-12-05 21:17:05,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:07,546 INFO L124 PetriNetUnfolderBase]: 4816/13578 cut-off events. [2023-12-05 21:17:07,546 INFO L125 PetriNetUnfolderBase]: For 2951/2951 co-relation queries the response was YES. [2023-12-05 21:17:07,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28271 conditions, 13578 events. 4816/13578 cut-off events. For 2951/2951 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 138574 event pairs, 1910 based on Foata normal form. 0/12709 useless extension candidates. Maximal degree in co-relation 3107. Up to 6837 conditions per place. [2023-12-05 21:17:07,656 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 101 selfloop transitions, 4 changer transitions 0/218 dead transitions. [2023-12-05 21:17:07,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 218 transitions, 856 flow [2023-12-05 21:17:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:17:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:17:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-12-05 21:17:07,658 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7085492227979274 [2023-12-05 21:17:07,658 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-12-05 21:17:07,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-12-05 21:17:07,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:07,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-12-05 21:17:07,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:07,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:07,664 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:07,665 INFO L308 CegarLoopForPetriNet]: 170 programPoint places, 0 predicate places. [2023-12-05 21:17:07,665 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 218 transitions, 856 flow [2023-12-05 21:17:07,666 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:07,666 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:07,666 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:07,666 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:17:07,666 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:07,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1184450364, now seen corresponding path program 1 times [2023-12-05 21:17:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347473211] [2023-12-05 21:17:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347473211] [2023-12-05 21:17:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347473211] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692429702] [2023-12-05 21:17:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:07,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:07,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:17:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:07,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:17:07,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:07,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:07,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692429702] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:08,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:17:08,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111483789] [2023-12-05 21:17:08,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:08,099 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:17:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:17:08,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:17:08,101 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 193 [2023-12-05 21:17:08,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 218 transitions, 856 flow. Second operand has 11 states, 11 states have (on average 116.63636363636364) internal successors, (1283), 11 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:08,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:08,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 193 [2023-12-05 21:17:08,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:09,916 INFO L124 PetriNetUnfolderBase]: 4717/12840 cut-off events. [2023-12-05 21:17:09,916 INFO L125 PetriNetUnfolderBase]: For 7178/7535 co-relation queries the response was YES. [2023-12-05 21:17:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34403 conditions, 12840 events. 4717/12840 cut-off events. For 7178/7535 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 127005 event pairs, 1 based on Foata normal form. 3/12254 useless extension candidates. Maximal degree in co-relation 4032. Up to 6519 conditions per place. [2023-12-05 21:17:10,023 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 156 selfloop transitions, 9 changer transitions 45/320 dead transitions. [2023-12-05 21:17:10,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 320 transitions, 1878 flow [2023-12-05 21:17:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:17:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:17:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1331 transitions. [2023-12-05 21:17:10,027 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6896373056994819 [2023-12-05 21:17:10,027 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1331 transitions. [2023-12-05 21:17:10,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1331 transitions. [2023-12-05 21:17:10,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:10,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1331 transitions. [2023-12-05 21:17:10,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.1) internal successors, (1331), 10 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:10,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:10,035 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:10,035 INFO L308 CegarLoopForPetriNet]: 170 programPoint places, 8 predicate places. [2023-12-05 21:17:10,036 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 320 transitions, 1878 flow [2023-12-05 21:17:10,036 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 116.63636363636364) internal successors, (1283), 11 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:10,037 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:10,037 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:10,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:17:10,243 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-05 21:17:10,243 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:10,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1269677230, now seen corresponding path program 1 times [2023-12-05 21:17:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:10,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534501777] [2023-12-05 21:17:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:10,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:17:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:10,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:17:10,292 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:17:10,292 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:17:10,293 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:17:10,295 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:17:10,295 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:17:10,295 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:17:10,295 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:17:10,296 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:17:10,301 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:17:10,301 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:17:10,336 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:17:10,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 236 transitions, 499 flow [2023-12-05 21:17:10,406 INFO L124 PetriNetUnfolderBase]: 81/547 cut-off events. [2023-12-05 21:17:10,406 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:17:10,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 547 events. 81/547 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2331 event pairs, 1 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 373. Up to 16 conditions per place. [2023-12-05 21:17:10,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 236 transitions, 499 flow [2023-12-05 21:17:10,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 236 transitions, 499 flow [2023-12-05 21:17:10,423 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:10,423 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;@ee39d20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:10,423 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:10,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:10,427 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-12-05 21:17:10,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:10,427 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:10,427 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:10,427 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:10,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash -795837077, now seen corresponding path program 1 times [2023-12-05 21:17:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:10,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850868549] [2023-12-05 21:17:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:10,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:10,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850868549] [2023-12-05 21:17:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850868549] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:10,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:10,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703929721] [2023-12-05 21:17:10,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:10,580 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:10,581 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 236 [2023-12-05 21:17:10,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 236 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:10,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:10,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 236 [2023-12-05 21:17:10,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:26,474 INFO L124 PetriNetUnfolderBase]: 65557/143067 cut-off events. [2023-12-05 21:17:26,474 INFO L125 PetriNetUnfolderBase]: For 2245/2245 co-relation queries the response was YES. [2023-12-05 21:17:27,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232985 conditions, 143067 events. 65557/143067 cut-off events. For 2245/2245 co-relation queries the response was YES. Maximal size of possible extension queue 2900. Compared 1776279 event pairs, 50471 based on Foata normal form. 38179/172990 useless extension candidates. Maximal degree in co-relation 16597. Up to 70692 conditions per place. [2023-12-05 21:17:27,998 INFO L140 encePairwiseOnDemand]: 202/236 looper letters, 86 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2023-12-05 21:17:27,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 231 transitions, 665 flow [2023-12-05 21:17:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-12-05 21:17:28,001 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.809322033898305 [2023-12-05 21:17:28,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-12-05 21:17:28,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-12-05 21:17:28,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:28,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-12-05 21:17:28,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:28,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:28,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:28,007 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2023-12-05 21:17:28,007 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 231 transitions, 665 flow [2023-12-05 21:17:28,007 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:28,007 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:28,007 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:28,007 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:17:28,007 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:28,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash -795837076, now seen corresponding path program 1 times [2023-12-05 21:17:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158161811] [2023-12-05 21:17:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158161811] [2023-12-05 21:17:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158161811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:28,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:28,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135459037] [2023-12-05 21:17:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:28,069 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:28,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:28,070 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 236 [2023-12-05 21:17:28,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 231 transitions, 665 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:28,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:28,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 236 [2023-12-05 21:17:28,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:48,033 INFO L124 PetriNetUnfolderBase]: 85089/183809 cut-off events. [2023-12-05 21:17:48,033 INFO L125 PetriNetUnfolderBase]: For 31233/35681 co-relation queries the response was YES. [2023-12-05 21:17:49,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407868 conditions, 183809 events. 85089/183809 cut-off events. For 31233/35681 co-relation queries the response was YES. Maximal size of possible extension queue 3440. Compared 2312283 event pairs, 45401 based on Foata normal form. 0/174647 useless extension candidates. Maximal degree in co-relation 28460. Up to 103073 conditions per place. [2023-12-05 21:17:50,250 INFO L140 encePairwiseOnDemand]: 230/236 looper letters, 133 selfloop transitions, 4 changer transitions 0/275 dead transitions. [2023-12-05 21:17:50,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 275 transitions, 1109 flow [2023-12-05 21:17:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:17:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:17:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 669 transitions. [2023-12-05 21:17:50,253 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7086864406779662 [2023-12-05 21:17:50,253 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 669 transitions. [2023-12-05 21:17:50,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 669 transitions. [2023-12-05 21:17:50,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:50,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 669 transitions. [2023-12-05 21:17:50,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:50,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:50,258 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:50,258 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2023-12-05 21:17:50,258 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 275 transitions, 1109 flow [2023-12-05 21:17:50,259 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:50,259 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:50,259 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:50,259 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:17:50,259 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:50,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1752377561, now seen corresponding path program 1 times [2023-12-05 21:17:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584754856] [2023-12-05 21:17:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584754856] [2023-12-05 21:17:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584754856] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742565556] [2023-12-05 21:17:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:50,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:50,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:50,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:50,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-05 21:17:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:50,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:17:50,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:50,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:50,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:50,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742565556] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:50,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:50,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:17:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305424213] [2023-12-05 21:17:50,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:50,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:17:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:50,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:17:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:17:50,667 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 236 [2023-12-05 21:17:50,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 275 transitions, 1109 flow. Second operand has 11 states, 11 states have (on average 141.63636363636363) internal successors, (1558), 11 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:50,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:50,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 236 [2023-12-05 21:17:50,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:18:16,768 INFO L124 PetriNetUnfolderBase]: 86948/185227 cut-off events. [2023-12-05 21:18:16,769 INFO L125 PetriNetUnfolderBase]: For 98424/106543 co-relation queries the response was YES. [2023-12-05 21:18:18,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536997 conditions, 185227 events. 86948/185227 cut-off events. For 98424/106543 co-relation queries the response was YES. Maximal size of possible extension queue 3241. Compared 2298047 event pairs, 2432 based on Foata normal form. 3/175809 useless extension candidates. Maximal degree in co-relation 36902. Up to 106649 conditions per place. [2023-12-05 21:18:19,244 INFO L140 encePairwiseOnDemand]: 226/236 looper letters, 242 selfloop transitions, 12 changer transitions 4/395 dead transitions. [2023-12-05 21:18:19,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 395 transitions, 2325 flow [2023-12-05 21:18:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:18:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:18:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1621 transitions. [2023-12-05 21:18:19,249 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.686864406779661 [2023-12-05 21:18:19,249 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1621 transitions. [2023-12-05 21:18:19,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1621 transitions. [2023-12-05 21:18:19,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:18:19,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1621 transitions. [2023-12-05 21:18:19,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 162.1) internal successors, (1621), 10 states have internal predecessors, (1621), 0 states have call successors, (0), 0 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:18:19,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 236.0) internal successors, (2596), 11 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:18:19,258 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 236.0) internal successors, (2596), 11 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:18:19,259 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, 9 predicate places. [2023-12-05 21:18:19,259 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 395 transitions, 2325 flow [2023-12-05 21:18:19,260 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 141.63636363636363) internal successors, (1558), 11 states have internal predecessors, (1558), 0 states have call successors, (0), 0 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:18:19,260 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:18:19,260 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:18:19,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-05 21:18:19,466 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:18:19,466 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:18:19,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:18:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1157469702, now seen corresponding path program 1 times [2023-12-05 21:18:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:18:19,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154458946] [2023-12-05 21:18:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:18:19,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:18:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:18:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:18:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:18:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154458946] [2023-12-05 21:18:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154458946] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:18:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409319968] [2023-12-05 21:18:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:18:19,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:18:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:18:19,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:18:19,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-05 21:18:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:18:19,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:18:19,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:18:19,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:18:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:18:20,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:18:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:18:20,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409319968] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:18:20,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:18:20,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:18:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832079672] [2023-12-05 21:18:20,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:18:20,298 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:18:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:18:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:18:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:18:20,301 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 236 [2023-12-05 21:18:20,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 395 transitions, 2325 flow. Second operand has 23 states, 23 states have (on average 141.82608695652175) internal successors, (3262), 23 states have internal predecessors, (3262), 0 states have call successors, (0), 0 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:18:20,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:18:20,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 236 [2023-12-05 21:18:20,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:18:25,178 INFO L124 PetriNetUnfolderBase]: 21963/40965 cut-off events. [2023-12-05 21:18:25,178 INFO L125 PetriNetUnfolderBase]: For 48651/53771 co-relation queries the response was YES. [2023-12-05 21:18:25,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156644 conditions, 40965 events. 21963/40965 cut-off events. For 48651/53771 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 390522 event pairs, 242 based on Foata normal form. 507/41097 useless extension candidates. Maximal degree in co-relation 10605. Up to 29114 conditions per place. [2023-12-05 21:18:25,577 INFO L140 encePairwiseOnDemand]: 229/236 looper letters, 256 selfloop transitions, 11 changer transitions 0/365 dead transitions. [2023-12-05 21:18:25,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 365 transitions, 2852 flow [2023-12-05 21:18:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:18:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:18:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2047 transitions. [2023-12-05 21:18:25,582 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6672099087353325 [2023-12-05 21:18:25,582 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2047 transitions. [2023-12-05 21:18:25,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2047 transitions. [2023-12-05 21:18:25,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:18:25,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2047 transitions. [2023-12-05 21:18:25,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 157.46153846153845) internal successors, (2047), 13 states have internal predecessors, (2047), 0 states have call successors, (0), 0 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:18:25,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 236.0) internal successors, (3304), 14 states have internal predecessors, (3304), 0 states have call successors, (0), 0 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:18:25,593 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 236.0) internal successors, (3304), 14 states have internal predecessors, (3304), 0 states have call successors, (0), 0 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:18:25,593 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -34 predicate places. [2023-12-05 21:18:25,593 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 365 transitions, 2852 flow [2023-12-05 21:18:25,595 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 141.82608695652175) internal successors, (3262), 23 states have internal predecessors, (3262), 0 states have call successors, (0), 0 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:18:25,595 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:18:25,595 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:18:25,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-05 21:18:25,800 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:18:25,800 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:18:25,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:18:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1521821452, now seen corresponding path program 1 times [2023-12-05 21:18:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:18:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934975303] [2023-12-05 21:18:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:18:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:18:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:18:25,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:18:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:18:25,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:18:25,850 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:18:25,850 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:18:25,850 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:18:25,850 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:18:25,850 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:18:25,850 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:18:25,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:18:25,851 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-05 21:18:25,851 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:18:25,851 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:18:25,883 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:18:25,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 279 transitions, 598 flow [2023-12-05 21:18:26,118 INFO L124 PetriNetUnfolderBase]: 120/809 cut-off events. [2023-12-05 21:18:26,118 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:18:26,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 809 events. 120/809 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3763 event pairs, 6 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 567. Up to 32 conditions per place. [2023-12-05 21:18:26,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 279 transitions, 598 flow [2023-12-05 21:18:26,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 279 transitions, 598 flow [2023-12-05 21:18:26,140 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:18:26,141 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;@ee39d20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:18:26,141 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:18:26,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:18:26,143 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-12-05 21:18:26,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:18:26,143 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:18:26,143 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:18:26,143 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:18:26,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:18:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1979087294, now seen corresponding path program 1 times [2023-12-05 21:18:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:18:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426124205] [2023-12-05 21:18:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:18:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:18:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:18:26,175 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:18:26,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:18:26,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426124205] [2023-12-05 21:18:26,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426124205] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:18:26,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:18:26,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:18:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654635606] [2023-12-05 21:18:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:18:26,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:18:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:18:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:18:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:18:26,177 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 279 [2023-12-05 21:18:26,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 279 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:18:26,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:18:26,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 279 [2023-12-05 21:18:26,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand