/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_41-trylock_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:16:45,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:16:45,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:16:45,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:16:45,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:16:45,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:16:45,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:16:45,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:16:45,432 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:16:45,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:16:45,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:16:45,435 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:16:45,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:16:45,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:16:45,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:16:45,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:16:45,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:16:45,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:16:45,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:16:45,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:16:45,437 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:16:45,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:16:45,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:16:45,438 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:16:45,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:16:45,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:45,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:16:45,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:16:45,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:16:45,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:16:45,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:16:45,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:16:45,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:16:45,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:16:45,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:16:45,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:16:45,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:16:45,639 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:16:45,640 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:16:45,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i [2023-12-05 21:16:46,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:16:46,846 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:16:46,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i [2023-12-05 21:16:46,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0aa1ee1/52c1b5e308014cefa06b509cdba3dddf/FLAG7d56bbdfc [2023-12-05 21:16:46,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0aa1ee1/52c1b5e308014cefa06b509cdba3dddf [2023-12-05 21:16:46,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:16:46,880 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:16:46,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:46,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:16:46,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:16:46,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:46" (1/1) ... [2023-12-05 21:16:46,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b9fd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:46, skipping insertion in model container [2023-12-05 21:16:46,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:46" (1/1) ... [2023-12-05 21:16:46,918 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:16:47,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:47,164 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:16:47,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:47,233 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:16:47,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47 WrapperNode [2023-12-05 21:16:47,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:47,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:47,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:16:47,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:16:47,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,277 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2023-12-05 21:16:47,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:47,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:16:47,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:16:47,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:16:47,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:16:47,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:16:47,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:16:47,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:16:47,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (1/1) ... [2023-12-05 21:16:47,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:47,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:16:47,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:16:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:16:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:16:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:16:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:16:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:16:47,370 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:16:47,371 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:16:47,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:16:47,371 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2023-12-05 21:16:47,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:16:47,371 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:16:47,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:16:47,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:16:47,373 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:16:47,470 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:16:47,471 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:16:47,608 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:16:47,642 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:16:47,643 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-12-05 21:16:47,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:47 BoogieIcfgContainer [2023-12-05 21:16:47,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:16:47,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:16:47,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:16:47,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:16:47,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:16:46" (1/3) ... [2023-12-05 21:16:47,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccd0951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:47, skipping insertion in model container [2023-12-05 21:16:47,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:47" (2/3) ... [2023-12-05 21:16:47,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccd0951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:47, skipping insertion in model container [2023-12-05 21:16:47,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:47" (3/3) ... [2023-12-05 21:16:47,649 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2023-12-05 21:16:47,660 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:16:47,660 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:16:47,661 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:16:47,703 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:16:47,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 120 transitions, 247 flow [2023-12-05 21:16:47,773 INFO L124 PetriNetUnfolderBase]: 23/172 cut-off events. [2023-12-05 21:16:47,774 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:16:47,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 172 events. 23/172 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 511 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 88. Up to 6 conditions per place. [2023-12-05 21:16:47,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 120 transitions, 247 flow [2023-12-05 21:16:47,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 120 transitions, 247 flow [2023-12-05 21:16:47,789 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:47,806 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;@1ca66373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:47,807 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:47,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:47,825 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-12-05 21:16:47,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:47,825 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:47,826 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:47,826 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:16:47,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 248364622, now seen corresponding path program 1 times [2023-12-05 21:16:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:47,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564097758] [2023-12-05 21:16:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:48,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564097758] [2023-12-05 21:16:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564097758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:48,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:48,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561617651] [2023-12-05 21:16:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:48,056 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:48,087 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 120 [2023-12-05 21:16:48,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 120 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:48,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 120 [2023-12-05 21:16:48,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:48,277 INFO L124 PetriNetUnfolderBase]: 69/430 cut-off events. [2023-12-05 21:16:48,278 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:16:48,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 430 events. 69/430 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2234 event pairs, 48 based on Foata normal form. 82/478 useless extension candidates. Maximal degree in co-relation 507. Up to 121 conditions per place. [2023-12-05 21:16:48,284 INFO L140 encePairwiseOnDemand]: 103/120 looper letters, 22 selfloop transitions, 1 changer transitions 17/108 dead transitions. [2023-12-05 21:16:48,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 108 transitions, 287 flow [2023-12-05 21:16:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-12-05 21:16:48,299 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7972222222222223 [2023-12-05 21:16:48,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-12-05 21:16:48,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-12-05 21:16:48,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:48,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-12-05 21:16:48,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,317 INFO L308 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2023-12-05 21:16:48,317 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 287 flow [2023-12-05 21:16:48,318 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,318 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:48,318 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:48,318 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:16:48,318 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:16:48,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash 248364623, now seen corresponding path program 1 times [2023-12-05 21:16:48,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267237480] [2023-12-05 21:16:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:48,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267237480] [2023-12-05 21:16:48,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267237480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:48,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482402565] [2023-12-05 21:16:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:48,455 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:48,456 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 120 [2023-12-05 21:16:48,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:48,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 120 [2023-12-05 21:16:48,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:48,564 INFO L124 PetriNetUnfolderBase]: 103/495 cut-off events. [2023-12-05 21:16:48,564 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-12-05 21:16:48,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 495 events. 103/495 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2600 event pairs, 6 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 835. Up to 174 conditions per place. [2023-12-05 21:16:48,567 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 33 selfloop transitions, 3 changer transitions 17/122 dead transitions. [2023-12-05 21:16:48,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 122 transitions, 443 flow [2023-12-05 21:16:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2023-12-05 21:16:48,568 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.70625 [2023-12-05 21:16:48,568 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 339 transitions. [2023-12-05 21:16:48,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions. [2023-12-05 21:16:48,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:48,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions. [2023-12-05 21:16:48,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,571 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,571 INFO L308 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2023-12-05 21:16:48,572 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 122 transitions, 443 flow [2023-12-05 21:16:48,572 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:48,572 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:48,573 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:48,573 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:16:48,573 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:48,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:48,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1860005606, now seen corresponding path program 1 times [2023-12-05 21:16:48,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:48,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486569741] [2023-12-05 21:16:48,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:48,786 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:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486569741] [2023-12-05 21:16:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486569741] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394501800] [2023-12-05 21:16:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:48,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:48,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:48,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:16:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:48,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:48,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:48,916 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:49,033 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:49,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:49,179 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:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394501800] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:49,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-12-05 21:16:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913537648] [2023-12-05 21:16:49,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:49,180 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 21:16:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 21:16:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-05 21:16:49,184 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 120 [2023-12-05 21:16:49,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 122 transitions, 443 flow. Second operand has 15 states, 15 states have (on average 74.33333333333333) internal successors, (1115), 15 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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:49,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:49,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 120 [2023-12-05 21:16:49,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:49,314 INFO L124 PetriNetUnfolderBase]: 30/165 cut-off events. [2023-12-05 21:16:49,314 INFO L125 PetriNetUnfolderBase]: For 114/138 co-relation queries the response was YES. [2023-12-05 21:16:49,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 165 events. 30/165 cut-off events. For 114/138 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 481 event pairs, 6 based on Foata normal form. 3/164 useless extension candidates. Maximal degree in co-relation 306. Up to 46 conditions per place. [2023-12-05 21:16:49,315 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 34 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-12-05 21:16:49,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 388 flow [2023-12-05 21:16:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 545 transitions. [2023-12-05 21:16:49,317 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2023-12-05 21:16:49,317 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 545 transitions. [2023-12-05 21:16:49,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 545 transitions. [2023-12-05 21:16:49,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:49,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 545 transitions. [2023-12-05 21:16:49,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call 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:49,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call 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:49,320 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call 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:49,320 INFO L308 CegarLoopForPetriNet]: 108 programPoint places, -33 predicate places. [2023-12-05 21:16:49,320 INFO L500 AbstractCegarLoop]: Abstraction has has 75 places, 81 transitions, 388 flow [2023-12-05 21:16:49,321 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 74.33333333333333) internal successors, (1115), 15 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call 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:49,321 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:49,321 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:49,328 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:16:49,526 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:16:49,526 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:16:49,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1825598625, now seen corresponding path program 1 times [2023-12-05 21:16:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:49,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973066533] [2023-12-05 21:16:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:49,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:49,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:49,591 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:49,592 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:16:49,594 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:16:49,594 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:16:49,594 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:16:49,594 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:16:49,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:16:49,595 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:16:49,596 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:49,596 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:16:49,615 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:16:49,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 153 transitions, 322 flow [2023-12-05 21:16:49,653 INFO L124 PetriNetUnfolderBase]: 40/285 cut-off events. [2023-12-05 21:16:49,653 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:16:49,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 285 events. 40/285 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 985 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 174. Up to 9 conditions per place. [2023-12-05 21:16:49,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 153 transitions, 322 flow [2023-12-05 21:16:49,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 153 transitions, 322 flow [2023-12-05 21:16:49,659 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:49,661 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;@1ca66373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:49,661 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:49,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:49,664 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-12-05 21:16:49,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:49,664 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:49,664 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:49,664 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:16:49,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash -123419865, now seen corresponding path program 1 times [2023-12-05 21:16:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641758532] [2023-12-05 21:16:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:49,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641758532] [2023-12-05 21:16:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641758532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:49,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:49,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998189480] [2023-12-05 21:16:49,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:49,714 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:49,715 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 153 [2023-12-05 21:16:49,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 153 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call 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:49,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:49,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 153 [2023-12-05 21:16:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:50,074 INFO L124 PetriNetUnfolderBase]: 1104/3685 cut-off events. [2023-12-05 21:16:50,074 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-12-05 21:16:50,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5561 conditions, 3685 events. 1104/3685 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 32139 event pairs, 786 based on Foata normal form. 995/4422 useless extension candidates. Maximal degree in co-relation 743. Up to 1341 conditions per place. [2023-12-05 21:16:50,097 INFO L140 encePairwiseOnDemand]: 130/153 looper letters, 30 selfloop transitions, 1 changer transitions 17/141 dead transitions. [2023-12-05 21:16:50,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 141 transitions, 390 flow [2023-12-05 21:16:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-12-05 21:16:50,098 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8061002178649237 [2023-12-05 21:16:50,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-12-05 21:16:50,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-12-05 21:16:50,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:50,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-12-05 21:16:50,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,102 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, -3 predicate places. [2023-12-05 21:16:50,102 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 141 transitions, 390 flow [2023-12-05 21:16:50,103 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,103 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:50,103 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:50,103 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:16:50,103 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:16:50,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash -123419864, now seen corresponding path program 1 times [2023-12-05 21:16:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258159677] [2023-12-05 21:16:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258159677] [2023-12-05 21:16:50,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258159677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:50,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:50,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634930563] [2023-12-05 21:16:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:50,241 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:50,242 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153 [2023-12-05 21:16:50,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 141 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:50,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153 [2023-12-05 21:16:50,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:50,705 INFO L124 PetriNetUnfolderBase]: 1588/4542 cut-off events. [2023-12-05 21:16:50,706 INFO L125 PetriNetUnfolderBase]: For 955/955 co-relation queries the response was YES. [2023-12-05 21:16:50,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9387 conditions, 4542 events. 1588/4542 cut-off events. For 955/955 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 39837 event pairs, 570 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 1207. Up to 2193 conditions per place. [2023-12-05 21:16:50,729 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 43 selfloop transitions, 3 changer transitions 29/163 dead transitions. [2023-12-05 21:16:50,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 163 transitions, 618 flow [2023-12-05 21:16:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2023-12-05 21:16:50,731 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.704248366013072 [2023-12-05 21:16:50,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 431 transitions. [2023-12-05 21:16:50,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 431 transitions. [2023-12-05 21:16:50,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:50,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 431 transitions. [2023-12-05 21:16:50,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,733 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,734 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2023-12-05 21:16:50,734 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 163 transitions, 618 flow [2023-12-05 21:16:50,734 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:50,734 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:50,734 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:50,734 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:16:50,738 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:50,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 361127188, now seen corresponding path program 1 times [2023-12-05 21:16:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129621945] [2023-12-05 21:16:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:50,875 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:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129621945] [2023-12-05 21:16:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129621945] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890177536] [2023-12-05 21:16:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:50,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:50,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:50,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:50,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:16:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:50,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:50,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:50,949 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:51,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:16:51,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:51,113 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:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890177536] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:51,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-12-05 21:16:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460122341] [2023-12-05 21:16:51,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:51,114 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 21:16:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 21:16:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-05 21:16:51,116 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2023-12-05 21:16:51,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 163 transitions, 618 flow. Second operand has 15 states, 15 states have (on average 93.33333333333333) internal successors, (1400), 15 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:51,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2023-12-05 21:16:51,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:51,411 INFO L124 PetriNetUnfolderBase]: 492/1270 cut-off events. [2023-12-05 21:16:51,412 INFO L125 PetriNetUnfolderBase]: For 1057/1204 co-relation queries the response was YES. [2023-12-05 21:16:51,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 1270 events. 492/1270 cut-off events. For 1057/1204 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8294 event pairs, 0 based on Foata normal form. 6/1255 useless extension candidates. Maximal degree in co-relation 468. Up to 753 conditions per place. [2023-12-05 21:16:51,419 INFO L140 encePairwiseOnDemand]: 146/153 looper letters, 79 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2023-12-05 21:16:51,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 148 transitions, 806 flow [2023-12-05 21:16:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:16:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:16:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1001 transitions. [2023-12-05 21:16:51,421 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6542483660130719 [2023-12-05 21:16:51,421 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1001 transitions. [2023-12-05 21:16:51,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1001 transitions. [2023-12-05 21:16:51,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:51,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1001 transitions. [2023-12-05 21:16:51,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.1) internal successors, (1001), 10 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,425 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,426 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2023-12-05 21:16:51,426 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 148 transitions, 806 flow [2023-12-05 21:16:51,426 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 93.33333333333333) internal successors, (1400), 15 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,426 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:51,427 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:51,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:51,632 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:16:51,633 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:16:51,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash 809710770, now seen corresponding path program 1 times [2023-12-05 21:16:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42411423] [2023-12-05 21:16:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:51,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:51,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:51,653 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:51,653 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:16:51,653 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:16:51,653 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:16:51,654 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:16:51,654 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:16:51,654 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:16:51,654 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:16:51,654 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:51,654 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:16:51,669 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:16:51,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 186 transitions, 399 flow [2023-12-05 21:16:51,695 INFO L124 PetriNetUnfolderBase]: 62/437 cut-off events. [2023-12-05 21:16:51,695 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:16:51,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 437 events. 62/437 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1664 event pairs, 1 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 293. Up to 16 conditions per place. [2023-12-05 21:16:51,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 186 transitions, 399 flow [2023-12-05 21:16:51,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 186 transitions, 399 flow [2023-12-05 21:16:51,702 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:51,702 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;@1ca66373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:51,702 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:51,704 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:51,704 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-12-05 21:16:51,704 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:51,704 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:51,704 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:51,704 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:16:51,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:51,704 INFO L85 PathProgramCache]: Analyzing trace with hash -912253343, now seen corresponding path program 1 times [2023-12-05 21:16:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:51,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50067210] [2023-12-05 21:16:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50067210] [2023-12-05 21:16:51,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50067210] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:51,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642140812] [2023-12-05 21:16:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:51,725 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:51,726 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 186 [2023-12-05 21:16:51,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 186 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:51,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 186 [2023-12-05 21:16:51,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:54,859 INFO L124 PetriNetUnfolderBase]: 12726/31743 cut-off events. [2023-12-05 21:16:54,859 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2023-12-05 21:16:54,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50353 conditions, 31743 events. 12726/31743 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 353356 event pairs, 9043 based on Foata normal form. 10398/40238 useless extension candidates. Maximal degree in co-relation 5550. Up to 13148 conditions per place. [2023-12-05 21:16:55,081 INFO L140 encePairwiseOnDemand]: 157/186 looper letters, 38 selfloop transitions, 1 changer transitions 23/174 dead transitions. [2023-12-05 21:16:55,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 495 flow [2023-12-05 21:16:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-12-05 21:16:55,096 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8118279569892473 [2023-12-05 21:16:55,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-12-05 21:16:55,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-12-05 21:16:55,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:55,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-12-05 21:16:55,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call 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:55,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call 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:55,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call 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:55,099 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, -3 predicate places. [2023-12-05 21:16:55,099 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 174 transitions, 495 flow [2023-12-05 21:16:55,099 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:55,099 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:55,099 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:55,099 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:16:55,099 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:16:55,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash -912253342, now seen corresponding path program 1 times [2023-12-05 21:16:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:55,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419612424] [2023-12-05 21:16:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:55,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:55,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419612424] [2023-12-05 21:16:55,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419612424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:55,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:55,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663749360] [2023-12-05 21:16:55,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:55,151 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:55,153 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 186 [2023-12-05 21:16:55,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 174 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call 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:55,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:55,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 186 [2023-12-05 21:16:55,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:58,962 INFO L124 PetriNetUnfolderBase]: 17536/42554 cut-off events. [2023-12-05 21:16:58,963 INFO L125 PetriNetUnfolderBase]: For 7151/7881 co-relation queries the response was YES. [2023-12-05 21:16:59,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90777 conditions, 42554 events. 17536/42554 cut-off events. For 7151/7881 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 485618 event pairs, 8953 based on Foata normal form. 0/40450 useless extension candidates. Maximal degree in co-relation 9815. Up to 21545 conditions per place. [2023-12-05 21:16:59,235 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 51 selfloop transitions, 3 changer transitions 41/202 dead transitions. [2023-12-05 21:16:59,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 202 transitions, 787 flow [2023-12-05 21:16:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-12-05 21:16:59,237 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7002688172043011 [2023-12-05 21:16:59,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-12-05 21:16:59,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-12-05 21:16:59,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:59,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-12-05 21:16:59,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call 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:59,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call 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:59,240 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call 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:59,242 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, 0 predicate places. [2023-12-05 21:16:59,242 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 787 flow [2023-12-05 21:16:59,242 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call 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:59,242 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:59,242 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:59,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:16:59,242 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:59,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash 754024143, now seen corresponding path program 1 times [2023-12-05 21:16:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239192570] [2023-12-05 21:16:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:59,329 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:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239192570] [2023-12-05 21:16:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239192570] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:59,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14088478] [2023-12-05 21:16:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:59,331 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:16:59,348 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:16:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:59,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:59,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:59,396 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:59,452 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:59,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:59,522 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:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14088478] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:59,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:16:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152923940] [2023-12-05 21:16:59,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:59,523 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:16:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:16:59,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:16:59,524 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 186 [2023-12-05 21:16:59,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 202 transitions, 787 flow. Second operand has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call 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:59,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:59,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 186 [2023-12-05 21:16:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:03,503 INFO L124 PetriNetUnfolderBase]: 18662/40930 cut-off events. [2023-12-05 21:17:03,503 INFO L125 PetriNetUnfolderBase]: For 20985/25675 co-relation queries the response was YES. [2023-12-05 21:17:03,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116712 conditions, 40930 events. 18662/40930 cut-off events. For 20985/25675 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 435737 event pairs, 1100 based on Foata normal form. 3/37637 useless extension candidates. Maximal degree in co-relation 12359. Up to 22293 conditions per place. [2023-12-05 21:17:03,884 INFO L140 encePairwiseOnDemand]: 176/186 looper letters, 120 selfloop transitions, 11 changer transitions 41/278 dead transitions. [2023-12-05 21:17:03,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 278 transitions, 1563 flow [2023-12-05 21:17:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:17:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:17:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1255 transitions. [2023-12-05 21:17:03,890 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6747311827956989 [2023-12-05 21:17:03,890 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1255 transitions. [2023-12-05 21:17:03,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1255 transitions. [2023-12-05 21:17:03,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:03,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1255 transitions. [2023-12-05 21:17:03,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.5) internal successors, (1255), 10 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:17:03,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,895 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,895 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, 9 predicate places. [2023-12-05 21:17:03,895 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 278 transitions, 1563 flow [2023-12-05 21:17:03,896 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:03,896 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:03,896 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:03,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-05 21:17:04,101 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:17:04,101 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:17:04,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1583244410, now seen corresponding path program 1 times [2023-12-05 21:17:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:04,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190227909] [2023-12-05 21:17:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:04,299 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:17:04,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190227909] [2023-12-05 21:17:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190227909] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961254908] [2023-12-05 21:17:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:04,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:04,301 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:17:04,304 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:17:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:04,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:17:04,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:04,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:04,723 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:17:04,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:04,922 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:17:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961254908] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:04,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:04,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:17:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606479026] [2023-12-05 21:17:04,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:04,923 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:17:04,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:04,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:17:04,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:17:04,925 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 186 [2023-12-05 21:17:04,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 278 transitions, 1563 flow. Second operand has 23 states, 23 states have (on average 112.82608695652173) internal successors, (2595), 23 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:04,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:04,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 186 [2023-12-05 21:17:04,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:06,663 INFO L124 PetriNetUnfolderBase]: 5490/10951 cut-off events. [2023-12-05 21:17:06,663 INFO L125 PetriNetUnfolderBase]: For 14509/17102 co-relation queries the response was YES. [2023-12-05 21:17:06,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40754 conditions, 10951 events. 5490/10951 cut-off events. For 14509/17102 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 93233 event pairs, 81 based on Foata normal form. 273/11067 useless extension candidates. Maximal degree in co-relation 4340. Up to 7466 conditions per place. [2023-12-05 21:17:06,742 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 160 selfloop transitions, 11 changer transitions 0/251 dead transitions. [2023-12-05 21:17:06,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 251 transitions, 1856 flow [2023-12-05 21:17:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:17:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:17:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1586 transitions. [2023-12-05 21:17:06,745 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2023-12-05 21:17:06,745 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1586 transitions. [2023-12-05 21:17:06,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1586 transitions. [2023-12-05 21:17:06,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:06,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1586 transitions. [2023-12-05 21:17:06,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.0) internal successors, (1586), 13 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:06,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 186.0) internal successors, (2604), 14 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:06,752 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 186.0) internal successors, (2604), 14 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:06,752 INFO L308 CegarLoopForPetriNet]: 164 programPoint places, -18 predicate places. [2023-12-05 21:17:06,752 INFO L500 AbstractCegarLoop]: Abstraction has has 146 places, 251 transitions, 1856 flow [2023-12-05 21:17:06,753 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 112.82608695652173) internal successors, (2595), 23 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:06,753 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:06,753 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:06,759 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:17:06,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:06,959 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:06,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1835935740, now seen corresponding path program 1 times [2023-12-05 21:17:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641322995] [2023-12-05 21:17:06,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:06,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:17:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:06,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:17:06,995 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:17:06,995 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:17:06,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:17:06,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:17:06,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:17:06,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:17:06,996 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:17:06,996 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-05 21:17:06,996 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:17:06,996 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:17:07,023 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:17:07,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 219 transitions, 478 flow [2023-12-05 21:17:07,071 INFO L124 PetriNetUnfolderBase]: 96/669 cut-off events. [2023-12-05 21:17:07,071 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:17:07,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 669 events. 96/669 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2895 event pairs, 6 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 457. Up to 32 conditions per place. [2023-12-05 21:17:07,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 219 transitions, 478 flow [2023-12-05 21:17:07,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 219 transitions, 478 flow [2023-12-05 21:17:07,083 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:07,084 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;@1ca66373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:07,084 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:07,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:07,085 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-12-05 21:17:07,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:07,085 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:07,085 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:07,085 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:07,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2118135812, now seen corresponding path program 1 times [2023-12-05 21:17:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178883524] [2023-12-05 21:17:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:07,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178883524] [2023-12-05 21:17:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178883524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414273051] [2023-12-05 21:17:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:07,110 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:07,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:07,111 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 219 [2023-12-05 21:17:07,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 219 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:07,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:07,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 219 [2023-12-05 21:17:07,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:38,771 INFO L124 PetriNetUnfolderBase]: 129362/270599 cut-off events. [2023-12-05 21:17:38,771 INFO L125 PetriNetUnfolderBase]: For 10376/10376 co-relation queries the response was YES. [2023-12-05 21:17:40,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445278 conditions, 270599 events. 129362/270599 cut-off events. For 10376/10376 co-relation queries the response was YES. Maximal size of possible extension queue 5541. Compared 3463867 event pairs, 90828 based on Foata normal form. 100078/356265 useless extension candidates. Maximal degree in co-relation 50378. Up to 121191 conditions per place. [2023-12-05 21:17:41,936 INFO L140 encePairwiseOnDemand]: 184/219 looper letters, 46 selfloop transitions, 1 changer transitions 29/207 dead transitions. [2023-12-05 21:17:41,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 207 transitions, 602 flow [2023-12-05 21:17:41,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2023-12-05 21:17:41,948 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8158295281582952 [2023-12-05 21:17:41,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2023-12-05 21:17:41,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2023-12-05 21:17:41,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:41,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2023-12-05 21:17:41,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:17:41,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:41,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:41,951 INFO L308 CegarLoopForPetriNet]: 192 programPoint places, -3 predicate places. [2023-12-05 21:17:41,951 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 207 transitions, 602 flow [2023-12-05 21:17:41,951 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:41,952 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:41,952 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:41,952 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:17:41,952 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:41,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2118135811, now seen corresponding path program 1 times [2023-12-05 21:17:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325285899] [2023-12-05 21:17:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:42,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:42,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325285899] [2023-12-05 21:17:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325285899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:42,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703987458] [2023-12-05 21:17:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:42,030 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:42,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:42,031 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 219 [2023-12-05 21:17:42,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 207 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:42,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:42,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 219 [2023-12-05 21:17:42,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand