/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_20-callback_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:15:23,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:15:23,716 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:15:23,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:15:23,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:15:23,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:15:23,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:15:23,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:15:23,750 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:15:23,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:15:23,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:15:23,754 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:15:23,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:15:23,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:15:23,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:15:23,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:15:23,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:15:23,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:15:23,756 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:15:23,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:15:23,757 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:15:23,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:15:23,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:15:23,758 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:15:23,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:15:23,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:15:23,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:15:23,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:15:23,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:15:23,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:15:23,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:15:23,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:15:23,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:15:23,760 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:15:23,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:15:23,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:15:23,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:15:23,984 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:15:23,985 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:15:23,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_20-callback_racefree.i [2023-12-05 21:15:25,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:15:25,408 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:15:25,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_20-callback_racefree.i [2023-12-05 21:15:25,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53237eeb/a26b8208caa047a7b7a8c09e60d9bb61/FLAG82ea47ab1 [2023-12-05 21:15:25,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f53237eeb/a26b8208caa047a7b7a8c09e60d9bb61 [2023-12-05 21:15:25,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:15:25,451 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:15:25,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:15:25,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:15:25,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:15:25,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:25,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a557ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25, skipping insertion in model container [2023-12-05 21:15:25,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:25,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:15:25,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:15:25,845 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:15:25,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:15:25,938 WARN L675 CHandler]: The function callback is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:15:25,944 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:15:25,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25 WrapperNode [2023-12-05 21:15:25,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:15:25,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:15:25,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:15:25,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:15:25,950 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:15:25" (1/1) ... [2023-12-05 21:15:25,962 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:15:25" (1/1) ... [2023-12-05 21:15:25,989 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 155 [2023-12-05 21:15:25,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:15:25,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:15:25,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:15:25,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:15:25,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:25,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:15:26,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:15:26,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:15:26,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:15:26,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (1/1) ... [2023-12-05 21:15:26,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:15:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:26,059 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:15:26,069 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:15:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:15:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:15:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:15:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:15:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:15:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:15:26,085 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:15:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:15:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:15:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:15:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:15:26,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:15:26,087 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:15:26,254 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:15:26,257 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:15:26,549 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:15:26,577 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:15:26,577 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-12-05 21:15:26,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:15:26 BoogieIcfgContainer [2023-12-05 21:15:26,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:15:26,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:15:26,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:15:26,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:15:26,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:15:25" (1/3) ... [2023-12-05 21:15:26,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1117322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:15:26, skipping insertion in model container [2023-12-05 21:15:26,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:25" (2/3) ... [2023-12-05 21:15:26,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1117322b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:15:26, skipping insertion in model container [2023-12-05 21:15:26,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:15:26" (3/3) ... [2023-12-05 21:15:26,586 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2023-12-05 21:15:26,599 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:15:26,599 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:15:26,599 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:15:26,644 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:15:26,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 161 transitions, 329 flow [2023-12-05 21:15:26,786 INFO L124 PetriNetUnfolderBase]: 27/247 cut-off events. [2023-12-05 21:15:26,786 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:15:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 247 events. 27/247 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 743 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 121. Up to 6 conditions per place. [2023-12-05 21:15:26,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 161 transitions, 329 flow [2023-12-05 21:15:26,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 161 transitions, 329 flow [2023-12-05 21:15:26,816 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:26,822 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;@218d24bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:26,822 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:15:26,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:26,830 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:15:26,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:26,831 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:26,831 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:26,832 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:15:26,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -843417043, now seen corresponding path program 1 times [2023-12-05 21:15:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235716160] [2023-12-05 21:15:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:27,169 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:15:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235716160] [2023-12-05 21:15:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235716160] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:27,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:27,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151968754] [2023-12-05 21:15:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:27,178 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:27,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:27,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:27,206 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2023-12-05 21:15:27,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 161 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:15:27,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:27,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2023-12-05 21:15:27,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:27,366 INFO L124 PetriNetUnfolderBase]: 57/490 cut-off events. [2023-12-05 21:15:27,367 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:15:27,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 490 events. 57/490 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2526 event pairs, 40 based on Foata normal form. 75/513 useless extension candidates. Maximal degree in co-relation 494. Up to 107 conditions per place. [2023-12-05 21:15:27,372 INFO L140 encePairwiseOnDemand]: 144/161 looper letters, 22 selfloop transitions, 1 changer transitions 12/147 dead transitions. [2023-12-05 21:15:27,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 147 transitions, 361 flow [2023-12-05 21:15:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-12-05 21:15:27,386 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8405797101449275 [2023-12-05 21:15:27,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-12-05 21:15:27,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-12-05 21:15:27,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:27,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-12-05 21:15:27,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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:15:27,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 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:15:27,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 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:15:27,401 INFO L308 CegarLoopForPetriNet]: 148 programPoint places, -3 predicate places. [2023-12-05 21:15:27,401 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 147 transitions, 361 flow [2023-12-05 21:15:27,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:15:27,401 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:27,402 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:27,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:15:27,402 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:15:27,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash -843417042, now seen corresponding path program 1 times [2023-12-05 21:15:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859062289] [2023-12-05 21:15:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:27,609 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:15:27,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:27,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859062289] [2023-12-05 21:15:27,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859062289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:27,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:27,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:27,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174728032] [2023-12-05 21:15:27,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:27,612 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:27,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:27,614 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 161 [2023-12-05 21:15:27,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 147 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:15:27,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:27,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 161 [2023-12-05 21:15:27,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:27,768 INFO L124 PetriNetUnfolderBase]: 82/562 cut-off events. [2023-12-05 21:15:27,769 INFO L125 PetriNetUnfolderBase]: For 85/99 co-relation queries the response was YES. [2023-12-05 21:15:27,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 562 events. 82/562 cut-off events. For 85/99 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2791 event pairs, 4 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 808. Up to 140 conditions per place. [2023-12-05 21:15:27,776 INFO L140 encePairwiseOnDemand]: 155/161 looper letters, 31 selfloop transitions, 3 changer transitions 13/157 dead transitions. [2023-12-05 21:15:27,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 489 flow [2023-12-05 21:15:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:15:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:15:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-12-05 21:15:27,781 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7748447204968945 [2023-12-05 21:15:27,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-12-05 21:15:27,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-12-05 21:15:27,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:27,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-12-05 21:15:27,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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:15:27,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 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:15:27,788 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 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:15:27,788 INFO L308 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2023-12-05 21:15:27,789 INFO L500 AbstractCegarLoop]: Abstraction has has 148 places, 157 transitions, 489 flow [2023-12-05 21:15:27,789 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:15:27,789 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:27,790 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:27,790 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:15:27,790 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:15:27,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash 466222772, now seen corresponding path program 1 times [2023-12-05 21:15:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:27,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024567548] [2023-12-05 21:15:27,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:28,074 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:15:28,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:28,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024567548] [2023-12-05 21:15:28,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024567548] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:28,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460506897] [2023-12-05 21:15:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:28,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:28,079 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:15:28,106 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:15:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:28,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:15:28,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:28,244 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:15:28,369 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:15:28,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:28,507 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:15:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460506897] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:28,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:28,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:15:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683300837] [2023-12-05 21:15:28,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:28,514 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:15:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:15:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:15:28,518 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 161 [2023-12-05 21:15:28,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 157 transitions, 489 flow. Second operand has 11 states, 11 states have (on average 115.63636363636364) internal successors, (1272), 11 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:15:28,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:28,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 161 [2023-12-05 21:15:28,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:28,641 INFO L124 PetriNetUnfolderBase]: 20/128 cut-off events. [2023-12-05 21:15:28,641 INFO L125 PetriNetUnfolderBase]: For 78/98 co-relation queries the response was YES. [2023-12-05 21:15:28,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 128 events. 20/128 cut-off events. For 78/98 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 286 event pairs, 0 based on Foata normal form. 7/132 useless extension candidates. Maximal degree in co-relation 205. Up to 32 conditions per place. [2023-12-05 21:15:28,643 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 26 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-12-05 21:15:28,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 81 transitions, 340 flow [2023-12-05 21:15:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:15:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:15:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-12-05 21:15:28,645 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7311446317657497 [2023-12-05 21:15:28,646 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-12-05 21:15:28,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-12-05 21:15:28,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:28,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-12-05 21:15:28,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:15:28,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 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:15:28,651 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 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:15:28,653 INFO L308 CegarLoopForPetriNet]: 148 programPoint places, -67 predicate places. [2023-12-05 21:15:28,653 INFO L500 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 340 flow [2023-12-05 21:15:28,654 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.63636363636364) internal successors, (1272), 11 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:15:28,654 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:28,654 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:28,667 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:15:28,859 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:15:28,861 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:15:28,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1568004443, now seen corresponding path program 1 times [2023-12-05 21:15:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507218796] [2023-12-05 21:15:28,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:28,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:28,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:28,919 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:28,920 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:15:28,921 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:15:28,921 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:15:28,922 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:15:28,922 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:15:28,922 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:15:28,923 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:15:28,925 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:28,925 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:15:28,951 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:15:28,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 191 transitions, 398 flow [2023-12-05 21:15:29,015 INFO L124 PetriNetUnfolderBase]: 45/391 cut-off events. [2023-12-05 21:15:29,016 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:15:29,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 391 events. 45/391 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1496 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 249. Up to 9 conditions per place. [2023-12-05 21:15:29,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 191 transitions, 398 flow [2023-12-05 21:15:29,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 191 transitions, 398 flow [2023-12-05 21:15:29,021 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:29,021 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;@218d24bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:29,022 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:15:29,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:29,025 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:15:29,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:29,025 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:29,025 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:29,025 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:15:29,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash 158372172, now seen corresponding path program 1 times [2023-12-05 21:15:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:29,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075845286] [2023-12-05 21:15:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:29,062 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:15:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:29,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075845286] [2023-12-05 21:15:29,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075845286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:29,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:29,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778160419] [2023-12-05 21:15:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:29,064 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:29,065 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 191 [2023-12-05 21:15:29,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 191 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 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:15:29,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:29,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 191 [2023-12-05 21:15:29,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:29,478 INFO L124 PetriNetUnfolderBase]: 649/2806 cut-off events. [2023-12-05 21:15:29,478 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:15:29,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3948 conditions, 2806 events. 649/2806 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 24743 event pairs, 476 based on Foata normal form. 646/3147 useless extension candidates. Maximal degree in co-relation 663. Up to 847 conditions per place. [2023-12-05 21:15:29,501 INFO L140 encePairwiseOnDemand]: 170/191 looper letters, 28 selfloop transitions, 1 changer transitions 13/174 dead transitions. [2023-12-05 21:15:29,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 174 transitions, 444 flow [2023-12-05 21:15:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-12-05 21:15:29,503 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8394415357766143 [2023-12-05 21:15:29,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-12-05 21:15:29,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-12-05 21:15:29,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:29,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-12-05 21:15:29,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:15:29,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:29,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:29,509 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, -6 predicate places. [2023-12-05 21:15:29,509 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 174 transitions, 444 flow [2023-12-05 21:15:29,510 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 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:15:29,510 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:29,510 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:29,510 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:15:29,510 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:15:29,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash 158372173, now seen corresponding path program 1 times [2023-12-05 21:15:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:29,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87757039] [2023-12-05 21:15:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:29,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:29,591 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:15:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87757039] [2023-12-05 21:15:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87757039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756308917] [2023-12-05 21:15:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:29,594 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:29,596 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 191 [2023-12-05 21:15:29,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 174 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:15:29,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:29,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 191 [2023-12-05 21:15:29,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:30,091 INFO L124 PetriNetUnfolderBase]: 906/3606 cut-off events. [2023-12-05 21:15:30,091 INFO L125 PetriNetUnfolderBase]: For 606/700 co-relation queries the response was YES. [2023-12-05 21:15:30,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 3606 events. 906/3606 cut-off events. For 606/700 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 31945 event pairs, 316 based on Foata normal form. 0/3361 useless extension candidates. Maximal degree in co-relation 1114. Up to 1271 conditions per place. [2023-12-05 21:15:30,116 INFO L140 encePairwiseOnDemand]: 185/191 looper letters, 39 selfloop transitions, 3 changer transitions 21/190 dead transitions. [2023-12-05 21:15:30,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 190 transitions, 624 flow [2023-12-05 21:15:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:15:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:15:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2023-12-05 21:15:30,118 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.768324607329843 [2023-12-05 21:15:30,118 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2023-12-05 21:15:30,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2023-12-05 21:15:30,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:30,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2023-12-05 21:15:30,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 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:15:30,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 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:15:30,122 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 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:15:30,123 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2023-12-05 21:15:30,123 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 190 transitions, 624 flow [2023-12-05 21:15:30,123 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:15:30,123 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:30,124 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:30,124 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:15:30,124 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:15:30,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash 590684631, now seen corresponding path program 1 times [2023-12-05 21:15:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:30,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379986430] [2023-12-05 21:15:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:30,256 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:15:30,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379986430] [2023-12-05 21:15:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379986430] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920430863] [2023-12-05 21:15:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:30,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:30,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:30,263 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:15:30,283 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:15:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:30,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:15:30,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:30,369 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:15:30,469 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:15:30,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:30,626 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:15:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920430863] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:30,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:30,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:15:30,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625351332] [2023-12-05 21:15:30,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:30,628 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:15:30,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:30,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:15:30,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:15:30,630 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 191 [2023-12-05 21:15:30,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 190 transitions, 624 flow. Second operand has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 0 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:15:30,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:30,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 191 [2023-12-05 21:15:30,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:31,245 INFO L124 PetriNetUnfolderBase]: 859/3213 cut-off events. [2023-12-05 21:15:31,245 INFO L125 PetriNetUnfolderBase]: For 1429/1662 co-relation queries the response was YES. [2023-12-05 21:15:31,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7214 conditions, 3213 events. 859/3213 cut-off events. For 1429/1662 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 27230 event pairs, 1 based on Foata normal form. 4/3042 useless extension candidates. Maximal degree in co-relation 1402. Up to 1169 conditions per place. [2023-12-05 21:15:31,270 INFO L140 encePairwiseOnDemand]: 182/191 looper letters, 76 selfloop transitions, 9 changer transitions 21/232 dead transitions. [2023-12-05 21:15:31,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 232 transitions, 1078 flow [2023-12-05 21:15:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:15:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:15:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1419 transitions. [2023-12-05 21:15:31,274 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7429319371727748 [2023-12-05 21:15:31,274 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1419 transitions. [2023-12-05 21:15:31,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1419 transitions. [2023-12-05 21:15:31,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:31,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1419 transitions. [2023-12-05 21:15:31,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 141.9) internal successors, (1419), 10 states have internal predecessors, (1419), 0 states have call successors, (0), 0 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:15:31,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 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:15:31,282 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 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:15:31,283 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 5 predicate places. [2023-12-05 21:15:31,283 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 232 transitions, 1078 flow [2023-12-05 21:15:31,286 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 0 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:15:31,287 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:31,287 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:31,293 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:15:31,494 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:15:31,495 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:15:31,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:31,495 INFO L85 PathProgramCache]: Analyzing trace with hash -824679574, now seen corresponding path program 1 times [2023-12-05 21:15:31,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7809534] [2023-12-05 21:15:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:31,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:31,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:31,533 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:31,533 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:15:31,534 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:15:31,534 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:15:31,534 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:15:31,534 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:15:31,534 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:15:31,534 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:15:31,535 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:31,535 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:15:31,556 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:15:31,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 221 transitions, 469 flow [2023-12-05 21:15:31,608 INFO L124 PetriNetUnfolderBase]: 68/574 cut-off events. [2023-12-05 21:15:31,609 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:15:31,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 574 events. 68/574 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2481 event pairs, 1 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 399. Up to 16 conditions per place. [2023-12-05 21:15:31,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 221 transitions, 469 flow [2023-12-05 21:15:31,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 221 transitions, 469 flow [2023-12-05 21:15:31,619 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:31,620 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;@218d24bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:31,620 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:15:31,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:31,623 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:15:31,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:31,623 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:31,623 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:31,623 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:15:31,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1673225911, now seen corresponding path program 1 times [2023-12-05 21:15:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:31,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230345098] [2023-12-05 21:15:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:31,655 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:15:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230345098] [2023-12-05 21:15:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230345098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:31,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:31,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:31,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779331214] [2023-12-05 21:15:31,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:31,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:31,658 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 221 [2023-12-05 21:15:31,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 221 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:15:31,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:31,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 221 [2023-12-05 21:15:31,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:33,785 INFO L124 PetriNetUnfolderBase]: 5424/16681 cut-off events. [2023-12-05 21:15:33,785 INFO L125 PetriNetUnfolderBase]: For 481/481 co-relation queries the response was YES. [2023-12-05 21:15:33,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24845 conditions, 16681 events. 5424/16681 cut-off events. For 481/481 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 189076 event pairs, 3973 based on Foata normal form. 4874/19970 useless extension candidates. Maximal degree in co-relation 3939. Up to 5960 conditions per place. [2023-12-05 21:15:33,917 INFO L140 encePairwiseOnDemand]: 196/221 looper letters, 34 selfloop transitions, 1 changer transitions 17/201 dead transitions. [2023-12-05 21:15:33,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 201 transitions, 529 flow [2023-12-05 21:15:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-12-05 21:15:33,919 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8386123680241327 [2023-12-05 21:15:33,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-12-05 21:15:33,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-12-05 21:15:33,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:33,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-12-05 21:15:33,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:33,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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:15:33,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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:15:33,924 INFO L308 CegarLoopForPetriNet]: 202 programPoint places, -9 predicate places. [2023-12-05 21:15:33,924 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 201 transitions, 529 flow [2023-12-05 21:15:33,924 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:15:33,924 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:33,925 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:33,925 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:15:33,925 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:15:33,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1673225910, now seen corresponding path program 1 times [2023-12-05 21:15:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617848531] [2023-12-05 21:15:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:34,084 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:15:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617848531] [2023-12-05 21:15:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617848531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:34,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787434955] [2023-12-05 21:15:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:34,086 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:34,087 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 221 [2023-12-05 21:15:34,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 201 transitions, 529 flow. Second operand has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 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:15:34,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:34,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 221 [2023-12-05 21:15:34,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:36,459 INFO L124 PetriNetUnfolderBase]: 7141/21321 cut-off events. [2023-12-05 21:15:36,459 INFO L125 PetriNetUnfolderBase]: For 3462/4678 co-relation queries the response was YES. [2023-12-05 21:15:36,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41478 conditions, 21321 events. 7141/21321 cut-off events. For 3462/4678 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 246745 event pairs, 3633 based on Foata normal form. 0/19751 useless extension candidates. Maximal degree in co-relation 6386. Up to 9033 conditions per place. [2023-12-05 21:15:36,620 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 45 selfloop transitions, 3 changer transitions 29/221 dead transitions. [2023-12-05 21:15:36,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 221 transitions, 753 flow [2023-12-05 21:15:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:15:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:15:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 673 transitions. [2023-12-05 21:15:36,623 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7613122171945701 [2023-12-05 21:15:36,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 673 transitions. [2023-12-05 21:15:36,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 673 transitions. [2023-12-05 21:15:36,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:36,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 673 transitions. [2023-12-05 21:15:36,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 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:15:36,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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:15:36,627 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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:15:36,628 INFO L308 CegarLoopForPetriNet]: 202 programPoint places, -6 predicate places. [2023-12-05 21:15:36,628 INFO L500 AbstractCegarLoop]: Abstraction has has 196 places, 221 transitions, 753 flow [2023-12-05 21:15:36,628 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 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:15:36,628 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:36,629 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:36,629 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:15:36,629 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:15:36,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 474606360, now seen corresponding path program 1 times [2023-12-05 21:15:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:36,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363984456] [2023-12-05 21:15:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:36,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:36,747 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:15:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363984456] [2023-12-05 21:15:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363984456] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952258885] [2023-12-05 21:15:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:36,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:36,753 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:15:36,775 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:15:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:36,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:15:36,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:36,851 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:15:36,935 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:15:36,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:37,034 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:15:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952258885] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:37,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:15:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085275165] [2023-12-05 21:15:37,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:37,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:15:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:15:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:15:37,040 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 221 [2023-12-05 21:15:37,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 221 transitions, 753 flow. Second operand has 11 states, 11 states have (on average 153.63636363636363) internal successors, (1690), 11 states have internal predecessors, (1690), 0 states have call successors, (0), 0 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:15:37,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:37,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 221 [2023-12-05 21:15:37,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:39,524 INFO L124 PetriNetUnfolderBase]: 7594/21518 cut-off events. [2023-12-05 21:15:39,525 INFO L125 PetriNetUnfolderBase]: For 9298/11233 co-relation queries the response was YES. [2023-12-05 21:15:39,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52786 conditions, 21518 events. 7594/21518 cut-off events. For 9298/11233 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 240621 event pairs, 386 based on Foata normal form. 4/20263 useless extension candidates. Maximal degree in co-relation 7991. Up to 9231 conditions per place. [2023-12-05 21:15:39,704 INFO L140 encePairwiseOnDemand]: 211/221 looper letters, 92 selfloop transitions, 11 changer transitions 29/275 dead transitions. [2023-12-05 21:15:39,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 275 transitions, 1317 flow [2023-12-05 21:15:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:15:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:15:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1631 transitions. [2023-12-05 21:15:39,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7380090497737557 [2023-12-05 21:15:39,709 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1631 transitions. [2023-12-05 21:15:39,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1631 transitions. [2023-12-05 21:15:39,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:39,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1631 transitions. [2023-12-05 21:15:39,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:39,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 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:15:39,718 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 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:15:39,718 INFO L308 CegarLoopForPetriNet]: 202 programPoint places, 3 predicate places. [2023-12-05 21:15:39,719 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 275 transitions, 1317 flow [2023-12-05 21:15:39,719 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 153.63636363636363) internal successors, (1690), 11 states have internal predecessors, (1690), 0 states have call successors, (0), 0 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:15:39,719 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:39,720 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:39,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:39,924 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:15:39,924 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:15:39,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash -663756914, now seen corresponding path program 1 times [2023-12-05 21:15:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:39,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009929498] [2023-12-05 21:15:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-05 21:15:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009929498] [2023-12-05 21:15:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009929498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:39,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682786156] [2023-12-05 21:15:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:39,984 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:39,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:39,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:39,986 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 221 [2023-12-05 21:15:39,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 275 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:15:39,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:39,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 221 [2023-12-05 21:15:39,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:43,639 INFO L124 PetriNetUnfolderBase]: 13184/34186 cut-off events. [2023-12-05 21:15:43,640 INFO L125 PetriNetUnfolderBase]: For 46440/47892 co-relation queries the response was YES. [2023-12-05 21:15:43,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100880 conditions, 34186 events. 13184/34186 cut-off events. For 46440/47892 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 393302 event pairs, 1416 based on Foata normal form. 0/32801 useless extension candidates. Maximal degree in co-relation 15106. Up to 15571 conditions per place. [2023-12-05 21:15:44,005 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 99 selfloop transitions, 2 changer transitions 29/296 dead transitions. [2023-12-05 21:15:44,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 296 transitions, 1717 flow [2023-12-05 21:15:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2023-12-05 21:15:44,010 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8280542986425339 [2023-12-05 21:15:44,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2023-12-05 21:15:44,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2023-12-05 21:15:44,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:44,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2023-12-05 21:15:44,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:44,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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:15:44,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 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:15:44,014 INFO L308 CegarLoopForPetriNet]: 202 programPoint places, 5 predicate places. [2023-12-05 21:15:44,014 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 296 transitions, 1717 flow [2023-12-05 21:15:44,014 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:15:44,015 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:44,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:44,015 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:15:44,015 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:15:44,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash -350033199, now seen corresponding path program 1 times [2023-12-05 21:15:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813594198] [2023-12-05 21:15:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:44,439 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:15:44,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813594198] [2023-12-05 21:15:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813594198] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166211404] [2023-12-05 21:15:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:44,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:44,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:44,441 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:15:44,462 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:15:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:44,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:15:44,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:44,549 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:15:44,796 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:15:44,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:45,050 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:15:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166211404] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:45,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:15:45,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071870273] [2023-12-05 21:15:45,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:45,054 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:15:45,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:45,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:15:45,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:15:45,058 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 221 [2023-12-05 21:15:45,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 296 transitions, 1717 flow. Second operand has 23 states, 23 states have (on average 153.82608695652175) internal successors, (3538), 23 states have internal predecessors, (3538), 0 states have call successors, (0), 0 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:15:45,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:45,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 221 [2023-12-05 21:15:45,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:45,922 INFO L124 PetriNetUnfolderBase]: 1940/4271 cut-off events. [2023-12-05 21:15:45,923 INFO L125 PetriNetUnfolderBase]: For 9106/10457 co-relation queries the response was YES. [2023-12-05 21:15:45,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17232 conditions, 4271 events. 1940/4271 cut-off events. For 9106/10457 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 33632 event pairs, 39 based on Foata normal form. 279/4487 useless extension candidates. Maximal degree in co-relation 2531. Up to 2702 conditions per place. [2023-12-05 21:15:45,967 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 112 selfloop transitions, 11 changer transitions 0/207 dead transitions. [2023-12-05 21:15:45,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 207 transitions, 1582 flow [2023-12-05 21:15:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:15:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:15:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2077 transitions. [2023-12-05 21:15:45,972 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7229376957883745 [2023-12-05 21:15:45,973 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2077 transitions. [2023-12-05 21:15:45,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2077 transitions. [2023-12-05 21:15:45,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:45,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2077 transitions. [2023-12-05 21:15:46,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 159.76923076923077) internal successors, (2077), 13 states have internal predecessors, (2077), 0 states have call successors, (0), 0 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:15:46,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 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:15:46,111 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 0 states have call successors, (0), 0 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:15:46,111 INFO L308 CegarLoopForPetriNet]: 202 programPoint places, -57 predicate places. [2023-12-05 21:15:46,111 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 207 transitions, 1582 flow [2023-12-05 21:15:46,113 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 153.82608695652175) internal successors, (3538), 23 states have internal predecessors, (3538), 0 states have call successors, (0), 0 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:15:46,113 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:46,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:46,121 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:15:46,319 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:46,319 INFO L425 AbstractCegarLoop]: === Iteration 6 === 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:15:46,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2033873586, now seen corresponding path program 1 times [2023-12-05 21:15:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:46,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201665490] [2023-12-05 21:15:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:46,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:46,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:46,351 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:46,351 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:15:46,352 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:15:46,352 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:15:46,352 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:15:46,352 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:15:46,352 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:15:46,352 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:15:46,353 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:46,353 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:15:46,377 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:15:46,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 251 transitions, 542 flow [2023-12-05 21:15:46,472 INFO L124 PetriNetUnfolderBase]: 103/837 cut-off events. [2023-12-05 21:15:46,472 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:15:46,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 837 events. 103/837 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3948 event pairs, 6 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 594. Up to 32 conditions per place. [2023-12-05 21:15:46,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 251 transitions, 542 flow [2023-12-05 21:15:46,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 251 transitions, 542 flow [2023-12-05 21:15:46,492 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:46,492 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;@218d24bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:46,493 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:15:46,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:46,495 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:15:46,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:46,495 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:46,495 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:46,495 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:15:46,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:46,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2043243996, now seen corresponding path program 1 times [2023-12-05 21:15:46,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:46,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503647919] [2023-12-05 21:15:46,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:46,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:46,527 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:15:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503647919] [2023-12-05 21:15:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503647919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145063283] [2023-12-05 21:15:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:46,528 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:46,529 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 251 [2023-12-05 21:15:46,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 251 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:46,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:46,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 251 [2023-12-05 21:15:46,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:58,070 INFO L124 PetriNetUnfolderBase]: 40119/99756 cut-off events. [2023-12-05 21:15:58,071 INFO L125 PetriNetUnfolderBase]: For 3912/3912 co-relation queries the response was YES. [2023-12-05 21:15:58,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155327 conditions, 99756 events. 40119/99756 cut-off events. For 3912/3912 co-relation queries the response was YES. Maximal size of possible extension queue 2936. Compared 1314326 event pairs, 28930 based on Foata normal form. 34312/125948 useless extension candidates. Maximal degree in co-relation 24834. Up to 39573 conditions per place. [2023-12-05 21:15:59,055 INFO L140 encePairwiseOnDemand]: 222/251 looper letters, 40 selfloop transitions, 1 changer transitions 21/228 dead transitions. [2023-12-05 21:15:59,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 228 transitions, 616 flow [2023-12-05 21:15:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-12-05 21:15:59,057 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8379814077025233 [2023-12-05 21:15:59,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-12-05 21:15:59,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-12-05 21:15:59,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:59,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-12-05 21:15:59,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 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:15:59,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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:15:59,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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:15:59,063 INFO L308 CegarLoopForPetriNet]: 229 programPoint places, -12 predicate places. [2023-12-05 21:15:59,063 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 228 transitions, 616 flow [2023-12-05 21:15:59,064 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:59,064 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:59,064 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:59,064 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:15:59,064 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:15:59,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:59,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2043243995, now seen corresponding path program 1 times [2023-12-05 21:15:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:59,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895498187] [2023-12-05 21:15:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:59,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:59,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895498187] [2023-12-05 21:15:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895498187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:59,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288797546] [2023-12-05 21:15:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:59,122 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:59,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:59,123 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 251 [2023-12-05 21:15:59,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 228 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 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:15:59,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:59,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 251 [2023-12-05 21:15:59,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:13,863 INFO L124 PetriNetUnfolderBase]: 51836/126896 cut-off events. [2023-12-05 21:16:13,863 INFO L125 PetriNetUnfolderBase]: For 20558/27754 co-relation queries the response was YES. [2023-12-05 21:16:14,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263610 conditions, 126896 events. 51836/126896 cut-off events. For 20558/27754 co-relation queries the response was YES. Maximal size of possible extension queue 3327. Compared 1695663 event pairs, 29830 based on Foata normal form. 0/118141 useless extension candidates. Maximal degree in co-relation 41757. Up to 59975 conditions per place. [2023-12-05 21:16:15,258 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 51 selfloop transitions, 3 changer transitions 37/252 dead transitions. [2023-12-05 21:16:15,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 252 transitions, 884 flow [2023-12-05 21:16:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2023-12-05 21:16:15,261 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7559760956175299 [2023-12-05 21:16:15,261 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2023-12-05 21:16:15,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2023-12-05 21:16:15,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:15,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2023-12-05 21:16:15,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,266 INFO L308 CegarLoopForPetriNet]: 229 programPoint places, -9 predicate places. [2023-12-05 21:16:15,266 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 252 transitions, 884 flow [2023-12-05 21:16:15,266 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,266 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:15,267 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:15,267 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:16:15,267 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:16:15,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 117987959, now seen corresponding path program 1 times [2023-12-05 21:16:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023336598] [2023-12-05 21:16:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023336598] [2023-12-05 21:16:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023336598] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214107138] [2023-12-05 21:16:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:15,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:15,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:15,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-05 21:16:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:15,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:15,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:15,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:16:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:15,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214107138] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:15,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201688300] [2023-12-05 21:16:15,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:15,844 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:15,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:15,847 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 251 [2023-12-05 21:16:15,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 252 transitions, 884 flow. Second operand has 14 states, 14 states have (on average 172.5) internal successors, (2415), 14 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:15,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 251 [2023-12-05 21:16:15,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:33,405 INFO L124 PetriNetUnfolderBase]: 54694/129483 cut-off events. [2023-12-05 21:16:33,406 INFO L125 PetriNetUnfolderBase]: For 53698/62001 co-relation queries the response was YES. [2023-12-05 21:16:35,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340673 conditions, 129483 events. 54694/129483 cut-off events. For 53698/62001 co-relation queries the response was YES. Maximal size of possible extension queue 3247. Compared 1686096 event pairs, 3722 based on Foata normal form. 4/122502 useless extension candidates. Maximal degree in co-relation 53359. Up to 61353 conditions per place. [2023-12-05 21:16:36,143 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 101 selfloop transitions, 10 changer transitions 37/308 dead transitions. [2023-12-05 21:16:36,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 308 transitions, 1496 flow [2023-12-05 21:16:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:16:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:16:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1834 transitions. [2023-12-05 21:16:36,160 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7306772908366533 [2023-12-05 21:16:36,160 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1834 transitions. [2023-12-05 21:16:36,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1834 transitions. [2023-12-05 21:16:36,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:36,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1834 transitions. [2023-12-05 21:16:36,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 183.4) internal successors, (1834), 10 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:36,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 251.0) internal successors, (2761), 11 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:36,168 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 251.0) internal successors, (2761), 11 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:36,168 INFO L308 CegarLoopForPetriNet]: 229 programPoint places, 0 predicate places. [2023-12-05 21:16:36,168 INFO L500 AbstractCegarLoop]: Abstraction has has 229 places, 308 transitions, 1496 flow [2023-12-05 21:16:36,169 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 172.5) internal successors, (2415), 14 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:36,169 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:36,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:36,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:36,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-05 21:16:36,396 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:16:36,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash 450005048, now seen corresponding path program 1 times [2023-12-05 21:16:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:36,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080516077] [2023-12-05 21:16:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:36,652 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:16:36,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:36,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080516077] [2023-12-05 21:16:36,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080516077] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363397788] [2023-12-05 21:16:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:36,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:36,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-05 21:16:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:36,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:16:36,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:36,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:16:37,111 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:16:37,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:37,694 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:16:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363397788] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:37,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:37,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:16:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818031319] [2023-12-05 21:16:37,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:37,696 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:16:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:16:37,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:16:37,701 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 251 [2023-12-05 21:16:37,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 308 transitions, 1496 flow. Second operand has 23 states, 23 states have (on average 172.82608695652175) internal successors, (3975), 23 states have internal predecessors, (3975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:37,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:37,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 251 [2023-12-05 21:16:37,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand