/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_11-ptr_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:14:47,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:14:47,501 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:14:47,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:14:47,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:14:47,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:14:47,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:14:47,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:14:47,529 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:14:47,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:14:47,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:14:47,532 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:14:47,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:14:47,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:14:47,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:14:47,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:14:47,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:14:47,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:14:47,533 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:14:47,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:14:47,534 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:14:47,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:14:47,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:14:47,535 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:14:47,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:14:47,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:14:47,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:14:47,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:14:47,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:14:47,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:14:47,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:14:47,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:14:47,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:14:47,537 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:14:47,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:14:47,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:14:47,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:14:47,737 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:14:47,738 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:14:47,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i [2023-12-05 21:14:48,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:14:48,989 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:14:48,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i [2023-12-05 21:14:49,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95f848208/f029ebae3fd141419bc54b5b672e6286/FLAG80dc6f8cb [2023-12-05 21:14:49,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95f848208/f029ebae3fd141419bc54b5b672e6286 [2023-12-05 21:14:49,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:14:49,013 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:14:49,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:14:49,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:14:49,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:14:49,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa4ae52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49, skipping insertion in model container [2023-12-05 21:14:49,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,051 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:14:49,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:14:49,322 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:14:49,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:14:49,405 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:14:49,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49 WrapperNode [2023-12-05 21:14:49,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:14:49,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:14:49,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:14:49,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:14:49,412 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:14:49" (1/1) ... [2023-12-05 21:14:49,437 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:14:49" (1/1) ... [2023-12-05 21:14:49,460 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2023-12-05 21:14:49,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:14:49,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:14:49,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:14:49,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:14:49,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:14:49,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:14:49,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:14:49,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:14:49,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (1/1) ... [2023-12-05 21:14:49,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:14:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:49,529 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:14:49,564 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:14:49,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:14:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:14:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:14:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:14:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:14:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:14:49,567 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:14:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:14:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:14:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:14:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:14:49,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:14:49,571 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:14:49,695 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:14:49,696 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:14:49,910 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:14:49,930 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:14:49,931 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:14:49,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:14:49 BoogieIcfgContainer [2023-12-05 21:14:49,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:14:49,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:14:49,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:14:49,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:14:49,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:14:49" (1/3) ... [2023-12-05 21:14:49,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15df8bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:14:49, skipping insertion in model container [2023-12-05 21:14:49,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:49" (2/3) ... [2023-12-05 21:14:49,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15df8bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:14:49, skipping insertion in model container [2023-12-05 21:14:49,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:14:49" (3/3) ... [2023-12-05 21:14:49,939 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2023-12-05 21:14:49,950 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:14:49,951 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-05 21:14:49,951 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:14:50,011 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:14:50,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 142 transitions, 291 flow [2023-12-05 21:14:50,104 INFO L124 PetriNetUnfolderBase]: 19/194 cut-off events. [2023-12-05 21:14:50,105 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:14:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 194 events. 19/194 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 620 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2023-12-05 21:14:50,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 142 transitions, 291 flow [2023-12-05 21:14:50,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 142 transitions, 291 flow [2023-12-05 21:14:50,134 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:50,140 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;@466a209b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:50,141 INFO L363 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-12-05 21:14:50,152 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:50,152 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:14:50,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:50,152 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:50,153 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:50,153 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:14:50,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1834896267, now seen corresponding path program 1 times [2023-12-05 21:14:50,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270464273] [2023-12-05 21:14:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:50,382 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:14:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270464273] [2023-12-05 21:14:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270464273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:50,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219704731] [2023-12-05 21:14:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:50,391 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:50,415 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 142 [2023-12-05 21:14:50,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 142 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:50,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:50,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 142 [2023-12-05 21:14:50,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:50,645 INFO L124 PetriNetUnfolderBase]: 183/778 cut-off events. [2023-12-05 21:14:50,645 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:14:50,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 778 events. 183/778 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5093 event pairs, 140 based on Foata normal form. 132/792 useless extension candidates. Maximal degree in co-relation 1087. Up to 317 conditions per place. [2023-12-05 21:14:50,655 INFO L140 encePairwiseOnDemand]: 126/142 looper letters, 47 selfloop transitions, 2 changer transitions 3/139 dead transitions. [2023-12-05 21:14:50,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 139 transitions, 389 flow [2023-12-05 21:14:50,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-12-05 21:14:50,671 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.795774647887324 [2023-12-05 21:14:50,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-12-05 21:14:50,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-12-05 21:14:50,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:50,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-12-05 21:14:50,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 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:14:50,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:50,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:50,691 INFO L308 CegarLoopForPetriNet]: 132 programPoint places, -3 predicate places. [2023-12-05 21:14:50,691 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 139 transitions, 389 flow [2023-12-05 21:14:50,692 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:50,692 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:50,692 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:50,692 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:14:50,692 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:14:50,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1834896266, now seen corresponding path program 1 times [2023-12-05 21:14:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089538674] [2023-12-05 21:14:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:50,900 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:14:50,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:50,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089538674] [2023-12-05 21:14:50,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089538674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:50,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:50,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:50,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108773097] [2023-12-05 21:14:50,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:50,902 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:50,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:50,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:50,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:50,904 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-12-05 21:14:50,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 139 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:50,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:50,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-12-05 21:14:50,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:51,166 INFO L124 PetriNetUnfolderBase]: 314/1144 cut-off events. [2023-12-05 21:14:51,167 INFO L125 PetriNetUnfolderBase]: For 243/267 co-relation queries the response was YES. [2023-12-05 21:14:51,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1144 events. 314/1144 cut-off events. For 243/267 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7670 event pairs, 54 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 2171. Up to 490 conditions per place. [2023-12-05 21:14:51,173 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 73 selfloop transitions, 4 changer transitions 6/169 dead transitions. [2023-12-05 21:14:51,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 169 transitions, 657 flow [2023-12-05 21:14:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2023-12-05 21:14:51,175 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7235915492957746 [2023-12-05 21:14:51,176 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 411 transitions. [2023-12-05 21:14:51,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 411 transitions. [2023-12-05 21:14:51,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:51,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 411 transitions. [2023-12-05 21:14:51,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,180 INFO L308 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2023-12-05 21:14:51,180 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 169 transitions, 657 flow [2023-12-05 21:14:51,180 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,181 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:51,181 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:51,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:14:51,181 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:14:51,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:51,182 INFO L85 PathProgramCache]: Analyzing trace with hash -612995807, now seen corresponding path program 1 times [2023-12-05 21:14:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:51,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977447090] [2023-12-05 21:14:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:51,480 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:14:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977447090] [2023-12-05 21:14:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977447090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:14:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079861911] [2023-12-05 21:14:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:51,484 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:14:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:14:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:14:51,487 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-12-05 21:14:51,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 169 transitions, 657 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:51,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-12-05 21:14:51,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:51,693 INFO L124 PetriNetUnfolderBase]: 230/885 cut-off events. [2023-12-05 21:14:51,694 INFO L125 PetriNetUnfolderBase]: For 672/805 co-relation queries the response was YES. [2023-12-05 21:14:51,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 885 events. 230/885 cut-off events. For 672/805 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5345 event pairs, 46 based on Foata normal form. 109/900 useless extension candidates. Maximal degree in co-relation 2106. Up to 369 conditions per place. [2023-12-05 21:14:51,698 INFO L140 encePairwiseOnDemand]: 131/142 looper letters, 79 selfloop transitions, 7 changer transitions 6/172 dead transitions. [2023-12-05 21:14:51,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 172 transitions, 875 flow [2023-12-05 21:14:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:14:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:14:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 646 transitions. [2023-12-05 21:14:51,701 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6498993963782697 [2023-12-05 21:14:51,701 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 646 transitions. [2023-12-05 21:14:51,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 646 transitions. [2023-12-05 21:14:51,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:51,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 646 transitions. [2023-12-05 21:14:51,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,704 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,705 INFO L308 CegarLoopForPetriNet]: 132 programPoint places, 0 predicate places. [2023-12-05 21:14:51,705 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 172 transitions, 875 flow [2023-12-05 21:14:51,705 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,705 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:51,705 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:51,706 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:14:51,706 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:14:51,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -612995808, now seen corresponding path program 1 times [2023-12-05 21:14:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:51,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254959963] [2023-12-05 21:14:51,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:14:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254959963] [2023-12-05 21:14:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254959963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:51,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:14:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071896293] [2023-12-05 21:14:51,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:51,842 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:14:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:14:51,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:14:51,844 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-12-05 21:14:51,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 172 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:51,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:51,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-12-05 21:14:51,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:52,062 INFO L124 PetriNetUnfolderBase]: 203/874 cut-off events. [2023-12-05 21:14:52,063 INFO L125 PetriNetUnfolderBase]: For 1215/1226 co-relation queries the response was YES. [2023-12-05 21:14:52,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 874 events. 203/874 cut-off events. For 1215/1226 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5177 event pairs, 10 based on Foata normal form. 60/873 useless extension candidates. Maximal degree in co-relation 2401. Up to 316 conditions per place. [2023-12-05 21:14:52,067 INFO L140 encePairwiseOnDemand]: 129/142 looper letters, 70 selfloop transitions, 7 changer transitions 28/185 dead transitions. [2023-12-05 21:14:52,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 185 transitions, 1193 flow [2023-12-05 21:14:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:14:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:14:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 750 transitions. [2023-12-05 21:14:52,070 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6602112676056338 [2023-12-05 21:14:52,070 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 750 transitions. [2023-12-05 21:14:52,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 750 transitions. [2023-12-05 21:14:52,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:52,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 750 transitions. [2023-12-05 21:14:52,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.75) internal successors, (750), 8 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,075 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,076 INFO L308 CegarLoopForPetriNet]: 132 programPoint places, 7 predicate places. [2023-12-05 21:14:52,076 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 185 transitions, 1193 flow [2023-12-05 21:14:52,076 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.42857142857143) internal successors, (584), 7 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,077 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:52,077 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:52,077 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:14:52,077 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:14:52,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash -835773060, now seen corresponding path program 1 times [2023-12-05 21:14:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:52,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982077124] [2023-12-05 21:14:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:52,190 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:14:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982077124] [2023-12-05 21:14:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982077124] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:52,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721065935] [2023-12-05 21:14:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:52,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:52,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:52,193 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:14:52,223 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:14:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:52,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:14:52,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:14:52,321 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:14:52,441 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:14:52,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:14:52,557 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:14:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721065935] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:14:52,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:14:52,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:14:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107496066] [2023-12-05 21:14:52,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:14:52,558 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:14:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:14:52,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:14:52,560 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-12-05 21:14:52,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 185 transitions, 1193 flow. Second operand has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:52,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-12-05 21:14:52,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:52,705 INFO L124 PetriNetUnfolderBase]: 51/215 cut-off events. [2023-12-05 21:14:52,706 INFO L125 PetriNetUnfolderBase]: For 562/564 co-relation queries the response was YES. [2023-12-05 21:14:52,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 215 events. 51/215 cut-off events. For 562/564 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 702 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 605. Up to 75 conditions per place. [2023-12-05 21:14:52,707 INFO L140 encePairwiseOnDemand]: 135/142 looper letters, 53 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-12-05 21:14:52,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 108 transitions, 780 flow [2023-12-05 21:14:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:14:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:14:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 640 transitions. [2023-12-05 21:14:52,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6438631790744467 [2023-12-05 21:14:52,709 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 640 transitions. [2023-12-05 21:14:52,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 640 transitions. [2023-12-05 21:14:52,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:52,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 640 transitions. [2023-12-05 21:14:52,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,719 INFO L308 CegarLoopForPetriNet]: 132 programPoint places, -34 predicate places. [2023-12-05 21:14:52,719 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 780 flow [2023-12-05 21:14:52,719 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:52,719 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:52,720 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:52,727 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:14:52,927 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:52,930 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:14:52,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -139160722, now seen corresponding path program 1 times [2023-12-05 21:14:52,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:52,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120508128] [2023-12-05 21:14:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:52,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:14:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:52,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:14:52,974 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:14:52,975 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2023-12-05 21:14:52,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2023-12-05 21:14:52,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2023-12-05 21:14:52,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2023-12-05 21:14:52,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2023-12-05 21:14:52,976 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2023-12-05 21:14:52,977 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2023-12-05 21:14:52,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2023-12-05 21:14:52,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2023-12-05 21:14:52,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2023-12-05 21:14:52,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2023-12-05 21:14:52,979 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2023-12-05 21:14:52,980 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2023-12-05 21:14:52,981 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2023-12-05 21:14:52,981 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2023-12-05 21:14:52,981 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2023-12-05 21:14:52,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:14:52,981 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:14:52,984 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:14:52,984 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:14:53,020 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:14:53,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 188 transitions, 392 flow [2023-12-05 21:14:53,046 INFO L124 PetriNetUnfolderBase]: 34/320 cut-off events. [2023-12-05 21:14:53,046 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:14:53,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 320 events. 34/320 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1221 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 196. Up to 8 conditions per place. [2023-12-05 21:14:53,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 188 transitions, 392 flow [2023-12-05 21:14:53,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 188 transitions, 392 flow [2023-12-05 21:14:53,052 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:53,053 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;@466a209b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:53,056 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-12-05 21:14:53,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:53,059 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2023-12-05 21:14:53,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:53,059 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:53,059 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:53,059 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:14:53,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash -172436747, now seen corresponding path program 1 times [2023-12-05 21:14:53,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:53,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332922736] [2023-12-05 21:14:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:53,086 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:14:53,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332922736] [2023-12-05 21:14:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332922736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:53,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:53,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79226920] [2023-12-05 21:14:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:53,087 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:53,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:53,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:53,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:53,089 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 188 [2023-12-05 21:14:53,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:53,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:53,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 188 [2023-12-05 21:14:53,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:54,491 INFO L124 PetriNetUnfolderBase]: 5995/14699 cut-off events. [2023-12-05 21:14:54,491 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-12-05 21:14:54,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24263 conditions, 14699 events. 5995/14699 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 149946 event pairs, 4606 based on Foata normal form. 2946/14914 useless extension candidates. Maximal degree in co-relation 1950. Up to 7347 conditions per place. [2023-12-05 21:14:54,580 INFO L140 encePairwiseOnDemand]: 166/188 looper letters, 80 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2023-12-05 21:14:54,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 193 transitions, 566 flow [2023-12-05 21:14:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-12-05 21:14:54,582 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8031914893617021 [2023-12-05 21:14:54,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-12-05 21:14:54,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-12-05 21:14:54,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:54,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-12-05 21:14:54,583 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:14:54,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:54,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:54,585 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, -3 predicate places. [2023-12-05 21:14:54,585 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 193 transitions, 566 flow [2023-12-05 21:14:54,585 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:54,585 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:54,586 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:54,586 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:14:54,586 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:14:54,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash -172436746, now seen corresponding path program 1 times [2023-12-05 21:14:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:54,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652125039] [2023-12-05 21:14:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:54,643 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:14:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652125039] [2023-12-05 21:14:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652125039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074274177] [2023-12-05 21:14:54,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:54,644 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:54,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:54,645 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 188 [2023-12-05 21:14:54,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 193 transitions, 566 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:54,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:54,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 188 [2023-12-05 21:14:54,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:57,178 INFO L124 PetriNetUnfolderBase]: 12977/29087 cut-off events. [2023-12-05 21:14:57,179 INFO L125 PetriNetUnfolderBase]: For 7431/7985 co-relation queries the response was YES. [2023-12-05 21:14:57,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63090 conditions, 29087 events. 12977/29087 cut-off events. For 7431/7985 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 305927 event pairs, 6239 based on Foata normal form. 0/25998 useless extension candidates. Maximal degree in co-relation 6848. Up to 15804 conditions per place. [2023-12-05 21:14:57,389 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 121 selfloop transitions, 4 changer transitions 0/239 dead transitions. [2023-12-05 21:14:57,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 239 transitions, 970 flow [2023-12-05 21:14:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-12-05 21:14:57,391 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7167553191489362 [2023-12-05 21:14:57,392 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-12-05 21:14:57,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-12-05 21:14:57,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:57,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-12-05 21:14:57,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:57,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:57,394 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:57,396 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, 0 predicate places. [2023-12-05 21:14:57,396 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 970 flow [2023-12-05 21:14:57,396 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:57,396 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:57,396 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:57,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:14:57,396 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:14:57,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1909500536, now seen corresponding path program 1 times [2023-12-05 21:14:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113431138] [2023-12-05 21:14:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:57,501 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:14:57,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113431138] [2023-12-05 21:14:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113431138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:57,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:57,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:14:57,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618289884] [2023-12-05 21:14:57,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:57,502 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:14:57,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:57,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:14:57,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:14:57,503 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 188 [2023-12-05 21:14:57,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 970 flow. Second operand has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:57,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:57,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 188 [2023-12-05 21:14:57,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:00,124 INFO L124 PetriNetUnfolderBase]: 12622/27641 cut-off events. [2023-12-05 21:15:00,125 INFO L125 PetriNetUnfolderBase]: For 20184/20769 co-relation queries the response was YES. [2023-12-05 21:15:00,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77555 conditions, 27641 events. 12622/27641 cut-off events. For 20184/20769 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 281539 event pairs, 4399 based on Foata normal form. 1514/27837 useless extension candidates. Maximal degree in co-relation 8619. Up to 14559 conditions per place. [2023-12-05 21:15:00,313 INFO L140 encePairwiseOnDemand]: 174/188 looper letters, 206 selfloop transitions, 15 changer transitions 0/330 dead transitions. [2023-12-05 21:15:00,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 330 transitions, 1886 flow [2023-12-05 21:15:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:15:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:15:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1050 transitions. [2023-12-05 21:15:00,316 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6981382978723404 [2023-12-05 21:15:00,316 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1050 transitions. [2023-12-05 21:15:00,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1050 transitions. [2023-12-05 21:15:00,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:00,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1050 transitions. [2023-12-05 21:15:00,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.25) internal successors, (1050), 8 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:00,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:00,321 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:00,322 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places. [2023-12-05 21:15:00,322 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 330 transitions, 1886 flow [2023-12-05 21:15:00,322 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:00,323 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:00,323 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:00,323 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:15:00,323 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:00,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1909500535, now seen corresponding path program 1 times [2023-12-05 21:15:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417697776] [2023-12-05 21:15:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417697776] [2023-12-05 21:15:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417697776] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:15:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624427548] [2023-12-05 21:15:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:00,451 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:15:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:15:00,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:15:00,452 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 188 [2023-12-05 21:15:00,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 330 transitions, 1886 flow. Second operand has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:00,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:00,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 188 [2023-12-05 21:15:00,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:02,614 INFO L124 PetriNetUnfolderBase]: 9016/20079 cut-off events. [2023-12-05 21:15:02,615 INFO L125 PetriNetUnfolderBase]: For 27832/29049 co-relation queries the response was YES. [2023-12-05 21:15:02,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70522 conditions, 20079 events. 9016/20079 cut-off events. For 27832/29049 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 195792 event pairs, 2962 based on Foata normal form. 2032/21115 useless extension candidates. Maximal degree in co-relation 8275. Up to 10151 conditions per place. [2023-12-05 21:15:02,757 INFO L140 encePairwiseOnDemand]: 178/188 looper letters, 230 selfloop transitions, 9 changer transitions 6/346 dead transitions. [2023-12-05 21:15:02,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 346 transitions, 2496 flow [2023-12-05 21:15:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:15:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:15:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-12-05 21:15:02,759 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6512158054711246 [2023-12-05 21:15:02,759 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-12-05 21:15:02,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-12-05 21:15:02,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:02,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-12-05 21:15:02,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:02,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:02,763 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:02,763 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places. [2023-12-05 21:15:02,763 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 346 transitions, 2496 flow [2023-12-05 21:15:02,763 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:02,764 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:02,764 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:02,764 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:15:02,764 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:02,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1922253520, now seen corresponding path program 1 times [2023-12-05 21:15:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202548652] [2023-12-05 21:15:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202548652] [2023-12-05 21:15:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202548652] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361956760] [2023-12-05 21:15:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:02,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:02,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:02,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:15:02,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:15:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:02,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:15:02,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:02,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:15:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:03,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361956760] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:03,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:15:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306810428] [2023-12-05 21:15:03,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:03,077 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:15:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:15:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:15:03,079 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 188 [2023-12-05 21:15:03,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 346 transitions, 2496 flow. Second operand has 14 states, 14 states have (on average 109.64285714285714) internal successors, (1535), 14 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:03,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:03,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 188 [2023-12-05 21:15:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:03,792 INFO L124 PetriNetUnfolderBase]: 2412/4979 cut-off events. [2023-12-05 21:15:03,792 INFO L125 PetriNetUnfolderBase]: For 17822/20190 co-relation queries the response was YES. [2023-12-05 21:15:03,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20529 conditions, 4979 events. 2412/4979 cut-off events. For 17822/20190 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 38523 event pairs, 60 based on Foata normal form. 0/4714 useless extension candidates. Maximal degree in co-relation 1794. Up to 3445 conditions per place. [2023-12-05 21:15:03,822 INFO L140 encePairwiseOnDemand]: 181/188 looper letters, 200 selfloop transitions, 8 changer transitions 0/287 dead transitions. [2023-12-05 21:15:03,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 287 transitions, 2551 flow [2023-12-05 21:15:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:15:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:15:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1223 transitions. [2023-12-05 21:15:03,825 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6505319148936171 [2023-12-05 21:15:03,825 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1223 transitions. [2023-12-05 21:15:03,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1223 transitions. [2023-12-05 21:15:03,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:03,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1223 transitions. [2023-12-05 21:15:03,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.3) internal successors, (1223), 10 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:03,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:03,830 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 188.0) internal successors, (2068), 11 states have internal predecessors, (2068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:03,830 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, -31 predicate places. [2023-12-05 21:15:03,830 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 287 transitions, 2551 flow [2023-12-05 21:15:03,831 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 109.64285714285714) internal successors, (1535), 14 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:03,831 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:03,831 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:03,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:04,035 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,SelfDestructingSolverStorable10 [2023-12-05 21:15:04,035 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:04,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1723047952, now seen corresponding path program 1 times [2023-12-05 21:15:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038854363] [2023-12-05 21:15:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-05 21:15:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038854363] [2023-12-05 21:15:04,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038854363] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012029380] [2023-12-05 21:15:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:04,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:04,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:15:04,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-05 21:15:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:04,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-05 21:15:04,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:04,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:15:04,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:15:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-05 21:15:04,422 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-05 21:15:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012029380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:04,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-05 21:15:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-12-05 21:15:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491494227] [2023-12-05 21:15:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:04,423 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:15:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:15:04,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:15:04,424 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 188 [2023-12-05 21:15:04,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 287 transitions, 2551 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:04,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:04,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 188 [2023-12-05 21:15:04,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:04,746 INFO L124 PetriNetUnfolderBase]: 1484/3202 cut-off events. [2023-12-05 21:15:04,746 INFO L125 PetriNetUnfolderBase]: For 18459/19009 co-relation queries the response was YES. [2023-12-05 21:15:04,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15043 conditions, 3202 events. 1484/3202 cut-off events. For 18459/19009 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 22733 event pairs, 0 based on Foata normal form. 436/3637 useless extension candidates. Maximal degree in co-relation 2022. Up to 2170 conditions per place. [2023-12-05 21:15:04,768 INFO L140 encePairwiseOnDemand]: 177/188 looper letters, 210 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2023-12-05 21:15:04,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 290 transitions, 3169 flow [2023-12-05 21:15:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:15:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:15:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2023-12-05 21:15:04,770 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2023-12-05 21:15:04,770 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions. [2023-12-05 21:15:04,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions. [2023-12-05 21:15:04,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:04,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions. [2023-12-05 21:15:04,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:04,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:04,772 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:04,772 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, -35 predicate places. [2023-12-05 21:15:04,773 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 290 transitions, 3169 flow [2023-12-05 21:15:04,773 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:04,773 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:04,773 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:04,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:04,977 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:04,978 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:04,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -543502295, now seen corresponding path program 1 times [2023-12-05 21:15:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:04,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131072371] [2023-12-05 21:15:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:04,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:04,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:05,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:05,011 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:05,011 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-12-05 21:15:05,011 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-12-05 21:15:05,011 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-12-05 21:15:05,011 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-12-05 21:15:05,012 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-12-05 21:15:05,013 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-12-05 21:15:05,014 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-12-05 21:15:05,014 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:15:05,014 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:05,015 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:05,015 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:15:05,037 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:15:05,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 234 transitions, 495 flow [2023-12-05 21:15:05,070 INFO L124 PetriNetUnfolderBase]: 54/485 cut-off events. [2023-12-05 21:15:05,070 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:15:05,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 485 events. 54/485 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2021 event pairs, 1 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 328. Up to 16 conditions per place. [2023-12-05 21:15:05,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 234 transitions, 495 flow [2023-12-05 21:15:05,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 234 transitions, 495 flow [2023-12-05 21:15:05,081 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:05,081 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;@466a209b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:05,081 INFO L363 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-12-05 21:15:05,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:05,083 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2023-12-05 21:15:05,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:05,083 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:05,083 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:05,083 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:15:05,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2079559349, now seen corresponding path program 1 times [2023-12-05 21:15:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:05,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375620769] [2023-12-05 21:15:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:05,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375620769] [2023-12-05 21:15:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375620769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:05,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831196799] [2023-12-05 21:15:05,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:05,104 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:05,105 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 234 [2023-12-05 21:15:05,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 234 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:05,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 234 [2023-12-05 21:15:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:32,154 INFO L124 PetriNetUnfolderBase]: 141380/275559 cut-off events. [2023-12-05 21:15:32,154 INFO L125 PetriNetUnfolderBase]: For 4141/4141 co-relation queries the response was YES. [2023-12-05 21:15:33,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472395 conditions, 275559 events. 141380/275559 cut-off events. For 4141/4141 co-relation queries the response was YES. Maximal size of possible extension queue 7026. Compared 3416910 event pairs, 108403 based on Foata normal form. 59160/278774 useless extension candidates. Maximal degree in co-relation 24244. Up to 150340 conditions per place. [2023-12-05 21:15:35,175 INFO L140 encePairwiseOnDemand]: 206/234 looper letters, 110 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2023-12-05 21:15:35,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 247 transitions, 745 flow [2023-12-05 21:15:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-12-05 21:15:35,177 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2023-12-05 21:15:35,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-12-05 21:15:35,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-12-05 21:15:35,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:35,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-12-05 21:15:35,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:35,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:35,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:35,180 INFO L308 CegarLoopForPetriNet]: 214 programPoint places, -3 predicate places. [2023-12-05 21:15:35,180 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 247 transitions, 745 flow [2023-12-05 21:15:35,180 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:35,180 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:35,180 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:35,180 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:15:35,180 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:15:35,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2079559350, now seen corresponding path program 1 times [2023-12-05 21:15:35,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:35,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357074713] [2023-12-05 21:15:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357074713] [2023-12-05 21:15:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357074713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545126873] [2023-12-05 21:15:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:35,217 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:35,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:35,218 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 234 [2023-12-05 21:15:35,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 247 transitions, 745 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:35,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:35,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 234 [2023-12-05 21:15:35,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand