/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_02-simple_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:13:35,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:13:35,826 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:13:35,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:13:35,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:13:35,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:13:35,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:13:35,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:13:35,848 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:13:35,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:13:35,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:13:35,852 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:13:35,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:13:35,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:13:35,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:13:35,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:13:35,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:13:35,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:13:35,853 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:13:35,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:13:35,854 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:13:35,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:13:35,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:13:35,855 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:13:35,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:13:35,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:13:35,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:13:35,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:13:35,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:13:35,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:13:35,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:13:35,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:13:35,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:13:35,856 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:13:36,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:13:36,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:13:36,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:13:36,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:13:36,088 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:13:36,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-12-05 21:13:37,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:13:37,268 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:13:37,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-12-05 21:13:37,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb424bf0f/d3b7c1cd1c2546eb88ac81bd5ce42933/FLAG05a7c831a [2023-12-05 21:13:37,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb424bf0f/d3b7c1cd1c2546eb88ac81bd5ce42933 [2023-12-05 21:13:37,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:13:37,294 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:13:37,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:13:37,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:13:37,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:13:37,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487b9b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37, skipping insertion in model container [2023-12-05 21:13:37,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,347 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:13:37,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:13:37,624 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:13:37,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:13:37,703 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:13:37,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37 WrapperNode [2023-12-05 21:13:37,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:13:37,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:13:37,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:13:37,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:13:37,718 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:13:37" (1/1) ... [2023-12-05 21:13:37,731 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:13:37" (1/1) ... [2023-12-05 21:13:37,746 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2023-12-05 21:13:37,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:13:37,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:13:37,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:13:37,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:13:37,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:13:37,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:13:37,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:13:37,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:13:37,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (1/1) ... [2023-12-05 21:13:37,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:13:37,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:37,802 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:13:37,809 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:13:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:13:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:13:37,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:13:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:13:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:13:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:13:37,827 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:13:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:13:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:13:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:13:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:13:37,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:13:37,828 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:13:37,923 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:13:37,924 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:13:38,105 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:13:38,129 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:13:38,129 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:13:38,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:13:38 BoogieIcfgContainer [2023-12-05 21:13:38,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:13:38,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:13:38,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:13:38,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:13:38,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:13:37" (1/3) ... [2023-12-05 21:13:38,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b27bb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:13:38, skipping insertion in model container [2023-12-05 21:13:38,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:13:37" (2/3) ... [2023-12-05 21:13:38,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b27bb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:13:38, skipping insertion in model container [2023-12-05 21:13:38,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:13:38" (3/3) ... [2023-12-05 21:13:38,137 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2023-12-05 21:13:38,149 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:13:38,150 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:13:38,150 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:13:38,215 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:13:38,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 126 transitions, 259 flow [2023-12-05 21:13:38,330 INFO L124 PetriNetUnfolderBase]: 19/174 cut-off events. [2023-12-05 21:13:38,330 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:13:38,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 19/174 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 470 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2023-12-05 21:13:38,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 126 transitions, 259 flow [2023-12-05 21:13:38,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 126 transitions, 259 flow [2023-12-05 21:13:38,358 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:38,364 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;@36a67449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:38,365 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:38,385 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:38,386 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-12-05 21:13:38,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:38,386 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:38,387 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:38,387 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:38,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1725100807, now seen corresponding path program 1 times [2023-12-05 21:13:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:38,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584919392] [2023-12-05 21:13:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:38,736 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:13:38,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:38,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584919392] [2023-12-05 21:13:38,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584919392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:38,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053502994] [2023-12-05 21:13:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:38,747 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:38,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:38,777 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 126 [2023-12-05 21:13:38,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 126 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:38,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:38,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 126 [2023-12-05 21:13:38,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:38,940 INFO L124 PetriNetUnfolderBase]: 67/434 cut-off events. [2023-12-05 21:13:38,940 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:13:38,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 434 events. 67/434 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2223 event pairs, 48 based on Foata normal form. 82/484 useless extension candidates. Maximal degree in co-relation 504. Up to 121 conditions per place. [2023-12-05 21:13:38,945 INFO L140 encePairwiseOnDemand]: 110/126 looper letters, 22 selfloop transitions, 1 changer transitions 17/115 dead transitions. [2023-12-05 21:13:38,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 301 flow [2023-12-05 21:13:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-12-05 21:13:38,958 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8121693121693122 [2023-12-05 21:13:38,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-12-05 21:13:38,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-12-05 21:13:38,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:38,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-12-05 21:13:38,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:38,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:38,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:38,973 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, -3 predicate places. [2023-12-05 21:13:38,974 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 115 transitions, 301 flow [2023-12-05 21:13:38,974 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:38,974 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:38,974 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:38,974 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:13:38,975 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:38,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1725100808, now seen corresponding path program 1 times [2023-12-05 21:13:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:38,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858903291] [2023-12-05 21:13:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:39,100 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:13:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858903291] [2023-12-05 21:13:39,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858903291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:39,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:39,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:13:39,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778272815] [2023-12-05 21:13:39,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:39,102 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:13:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:39,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:13:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:13:39,106 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 126 [2023-12-05 21:13:39,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 115 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:39,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 126 [2023-12-05 21:13:39,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:39,240 INFO L124 PetriNetUnfolderBase]: 96/484 cut-off events. [2023-12-05 21:13:39,240 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-12-05 21:13:39,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 484 events. 96/484 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2469 event pairs, 6 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 814. Up to 174 conditions per place. [2023-12-05 21:13:39,244 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 33 selfloop transitions, 3 changer transitions 17/129 dead transitions. [2023-12-05 21:13:39,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 129 transitions, 457 flow [2023-12-05 21:13:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:13:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:13:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2023-12-05 21:13:39,246 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7281746031746031 [2023-12-05 21:13:39,246 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 367 transitions. [2023-12-05 21:13:39,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 367 transitions. [2023-12-05 21:13:39,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:39,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 367 transitions. [2023-12-05 21:13:39,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,251 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,251 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 0 predicate places. [2023-12-05 21:13:39,252 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 129 transitions, 457 flow [2023-12-05 21:13:39,252 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,252 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:39,253 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:39,253 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:13:39,253 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:39,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1415545711, now seen corresponding path program 1 times [2023-12-05 21:13:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:39,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306744546] [2023-12-05 21:13:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:39,390 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:13:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306744546] [2023-12-05 21:13:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306744546] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736217638] [2023-12-05 21:13:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:39,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:39,395 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:13:39,455 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:13:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:39,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:13:39,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:39,581 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:13:39,703 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:13:39,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:39,850 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:13:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736217638] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:39,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:13:39,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787913617] [2023-12-05 21:13:39,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:39,857 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:13:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:13:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:13:39,860 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 126 [2023-12-05 21:13:39,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 129 transitions, 457 flow. Second operand has 11 states, 11 states have (on average 81.63636363636364) internal successors, (898), 11 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:39,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 126 [2023-12-05 21:13:39,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:39,981 INFO L124 PetriNetUnfolderBase]: 30/177 cut-off events. [2023-12-05 21:13:39,981 INFO L125 PetriNetUnfolderBase]: For 113/128 co-relation queries the response was YES. [2023-12-05 21:13:39,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 177 events. 30/177 cut-off events. For 113/128 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 493 event pairs, 0 based on Foata normal form. 3/177 useless extension candidates. Maximal degree in co-relation 308. Up to 46 conditions per place. [2023-12-05 21:13:39,983 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 34 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2023-12-05 21:13:39,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 91 transitions, 408 flow [2023-12-05 21:13:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:13:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:13:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 594 transitions. [2023-12-05 21:13:39,985 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2023-12-05 21:13:39,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 594 transitions. [2023-12-05 21:13:39,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 594 transitions. [2023-12-05 21:13:39,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:39,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 594 transitions. [2023-12-05 21:13:39,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,988 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,989 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, -31 predicate places. [2023-12-05 21:13:39,989 INFO L500 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 408 flow [2023-12-05 21:13:39,990 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.63636363636364) internal successors, (898), 11 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:39,990 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:39,990 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:40,011 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:13:40,195 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:40,198 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:40,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash -932243764, now seen corresponding path program 1 times [2023-12-05 21:13:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981035834] [2023-12-05 21:13:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:40,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:13:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:40,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:13:40,260 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:13:40,261 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:13:40,262 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:13:40,263 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:13:40,263 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:13:40,263 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:13:40,263 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:13:40,263 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:13:40,265 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:13:40,265 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:13:40,287 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:13:40,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 159 transitions, 334 flow [2023-12-05 21:13:40,333 INFO L124 PetriNetUnfolderBase]: 34/283 cut-off events. [2023-12-05 21:13:40,333 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:13:40,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 283 events. 34/283 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 915 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 176. Up to 8 conditions per place. [2023-12-05 21:13:40,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 159 transitions, 334 flow [2023-12-05 21:13:40,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 159 transitions, 334 flow [2023-12-05 21:13:40,341 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:40,343 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;@36a67449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:40,343 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:40,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:40,348 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-12-05 21:13:40,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:40,348 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:40,348 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:40,349 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:40,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash -836446714, now seen corresponding path program 1 times [2023-12-05 21:13:40,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:40,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842110583] [2023-12-05 21:13:40,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:40,402 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:13:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:40,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842110583] [2023-12-05 21:13:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842110583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702201657] [2023-12-05 21:13:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:40,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:40,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:40,408 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 159 [2023-12-05 21:13:40,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 159 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:40,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:40,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 159 [2023-12-05 21:13:40,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:40,809 INFO L124 PetriNetUnfolderBase]: 1095/3668 cut-off events. [2023-12-05 21:13:40,809 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-12-05 21:13:40,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 3668 events. 1095/3668 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 32104 event pairs, 786 based on Foata normal form. 994/4413 useless extension candidates. Maximal degree in co-relation 740. Up to 1341 conditions per place. [2023-12-05 21:13:40,831 INFO L140 encePairwiseOnDemand]: 137/159 looper letters, 30 selfloop transitions, 1 changer transitions 17/148 dead transitions. [2023-12-05 21:13:40,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 148 transitions, 404 flow [2023-12-05 21:13:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-12-05 21:13:40,833 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8176100628930818 [2023-12-05 21:13:40,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-12-05 21:13:40,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-12-05 21:13:40,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:40,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-12-05 21:13:40,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:40,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:40,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:40,837 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, -3 predicate places. [2023-12-05 21:13:40,837 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 148 transitions, 404 flow [2023-12-05 21:13:40,837 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:40,837 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:40,837 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:40,838 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:13:40,838 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:40,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -836446713, now seen corresponding path program 1 times [2023-12-05 21:13:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179709192] [2023-12-05 21:13:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:40,929 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:13:40,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179709192] [2023-12-05 21:13:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179709192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:40,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:40,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:13:40,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514921190] [2023-12-05 21:13:40,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:40,932 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:13:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:13:40,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:13:40,933 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 159 [2023-12-05 21:13:40,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 148 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:40,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:40,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 159 [2023-12-05 21:13:40,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:41,374 INFO L124 PetriNetUnfolderBase]: 1532/4384 cut-off events. [2023-12-05 21:13:41,374 INFO L125 PetriNetUnfolderBase]: For 955/955 co-relation queries the response was YES. [2023-12-05 21:13:41,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 4384 events. 1532/4384 cut-off events. For 955/955 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 38186 event pairs, 570 based on Foata normal form. 0/3988 useless extension candidates. Maximal degree in co-relation 1186. Up to 2193 conditions per place. [2023-12-05 21:13:41,463 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 43 selfloop transitions, 3 changer transitions 29/170 dead transitions. [2023-12-05 21:13:41,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 170 transitions, 632 flow [2023-12-05 21:13:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:13:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:13:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-12-05 21:13:41,465 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7216981132075472 [2023-12-05 21:13:41,465 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-12-05 21:13:41,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-12-05 21:13:41,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:41,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-12-05 21:13:41,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:41,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:41,468 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:41,470 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2023-12-05 21:13:41,470 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 170 transitions, 632 flow [2023-12-05 21:13:41,470 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:41,471 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:41,471 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:41,471 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:13:41,471 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:41,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash -192392463, now seen corresponding path program 1 times [2023-12-05 21:13:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:41,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176213327] [2023-12-05 21:13:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:41,580 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:13:41,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:41,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176213327] [2023-12-05 21:13:41,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176213327] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:41,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192606266] [2023-12-05 21:13:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:41,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:41,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:41,582 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:13:41,631 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:13:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:41,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:13:41,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:41,682 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:13:41,753 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:13:41,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:41,828 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:13:41,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192606266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:41,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:13:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228115208] [2023-12-05 21:13:41,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:41,829 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:13:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:41,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:13:41,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:13:41,831 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 159 [2023-12-05 21:13:41,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 170 transitions, 632 flow. Second operand has 11 states, 11 states have (on average 100.63636363636364) internal successors, (1107), 11 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:41,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:41,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 159 [2023-12-05 21:13:41,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:42,400 INFO L124 PetriNetUnfolderBase]: 1489/4107 cut-off events. [2023-12-05 21:13:42,401 INFO L125 PetriNetUnfolderBase]: For 2311/2664 co-relation queries the response was YES. [2023-12-05 21:13:42,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11162 conditions, 4107 events. 1489/4107 cut-off events. For 2311/2664 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 34118 event pairs, 1 based on Foata normal form. 6/3856 useless extension candidates. Maximal degree in co-relation 1540. Up to 2059 conditions per place. [2023-12-05 21:13:42,424 INFO L140 encePairwiseOnDemand]: 150/159 looper letters, 100 selfloop transitions, 9 changer transitions 29/232 dead transitions. [2023-12-05 21:13:42,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 232 transitions, 1270 flow [2023-12-05 21:13:42,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1107 transitions. [2023-12-05 21:13:42,427 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6962264150943396 [2023-12-05 21:13:42,427 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1107 transitions. [2023-12-05 21:13:42,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1107 transitions. [2023-12-05 21:13:42,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:42,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1107 transitions. [2023-12-05 21:13:42,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:42,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 159.0) internal successors, (1749), 11 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:42,433 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 159.0) internal successors, (1749), 11 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:42,434 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 8 predicate places. [2023-12-05 21:13:42,434 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 232 transitions, 1270 flow [2023-12-05 21:13:42,435 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.63636363636364) internal successors, (1107), 11 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:42,436 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:42,436 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:42,449 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:13:42,649 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-05 21:13:42,650 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:42,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1402924225, now seen corresponding path program 1 times [2023-12-05 21:13:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492367041] [2023-12-05 21:13:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:42,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:13:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:42,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:13:42,691 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:13:42,693 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:13:42,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:13:42,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:13:42,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:13:42,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:13:42,694 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:13:42,694 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:13:42,695 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:13:42,695 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:13:42,719 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:13:42,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 192 transitions, 411 flow [2023-12-05 21:13:42,753 INFO L124 PetriNetUnfolderBase]: 54/431 cut-off events. [2023-12-05 21:13:42,753 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:13:42,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 431 events. 54/431 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1573 event pairs, 1 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 291. Up to 16 conditions per place. [2023-12-05 21:13:42,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 192 transitions, 411 flow [2023-12-05 21:13:42,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 192 transitions, 411 flow [2023-12-05 21:13:42,762 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:42,763 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;@36a67449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:42,763 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:42,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:42,765 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-12-05 21:13:42,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:42,765 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:42,765 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:42,766 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:42,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -931262778, now seen corresponding path program 1 times [2023-12-05 21:13:42,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:42,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684719638] [2023-12-05 21:13:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:42,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:42,797 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:13:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:42,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684719638] [2023-12-05 21:13:42,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684719638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:42,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:42,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408289834] [2023-12-05 21:13:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:42,798 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:42,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:42,799 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 192 [2023-12-05 21:13:42,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 192 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:42,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:42,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 192 [2023-12-05 21:13:42,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:46,375 INFO L124 PetriNetUnfolderBase]: 12668/31579 cut-off events. [2023-12-05 21:13:46,375 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2023-12-05 21:13:46,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50189 conditions, 31579 events. 12668/31579 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 351147 event pairs, 9043 based on Foata normal form. 10399/40133 useless extension candidates. Maximal degree in co-relation 5533. Up to 13148 conditions per place. [2023-12-05 21:13:46,706 INFO L140 encePairwiseOnDemand]: 164/192 looper letters, 38 selfloop transitions, 1 changer transitions 23/181 dead transitions. [2023-12-05 21:13:46,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 509 flow [2023-12-05 21:13:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:13:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:13:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-12-05 21:13:46,708 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8211805555555556 [2023-12-05 21:13:46,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-12-05 21:13:46,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-12-05 21:13:46,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:46,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-12-05 21:13:46,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:46,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:46,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:46,710 INFO L308 CegarLoopForPetriNet]: 172 programPoint places, -3 predicate places. [2023-12-05 21:13:46,711 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 181 transitions, 509 flow [2023-12-05 21:13:46,711 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:46,711 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:46,711 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:46,711 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:13:46,711 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:46,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash -931262777, now seen corresponding path program 1 times [2023-12-05 21:13:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:46,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358181773] [2023-12-05 21:13:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:46,752 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:13:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358181773] [2023-12-05 21:13:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358181773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:13:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68939317] [2023-12-05 21:13:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:46,753 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:13:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:13:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:13:46,754 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 192 [2023-12-05 21:13:46,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 181 transitions, 509 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:46,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:46,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 192 [2023-12-05 21:13:46,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:51,009 INFO L124 PetriNetUnfolderBase]: 17431/42249 cut-off events. [2023-12-05 21:13:51,010 INFO L125 PetriNetUnfolderBase]: For 7151/7881 co-relation queries the response was YES. [2023-12-05 21:13:51,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90472 conditions, 42249 events. 17431/42249 cut-off events. For 7151/7881 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 482842 event pairs, 8953 based on Foata normal form. 0/40251 useless extension candidates. Maximal degree in co-relation 9770. Up to 21545 conditions per place. [2023-12-05 21:13:51,411 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 51 selfloop transitions, 3 changer transitions 41/209 dead transitions. [2023-12-05 21:13:51,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 209 transitions, 801 flow [2023-12-05 21:13:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:13:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:13:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-12-05 21:13:51,414 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.71484375 [2023-12-05 21:13:51,414 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-12-05 21:13:51,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-12-05 21:13:51,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:51,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-12-05 21:13:51,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:51,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:51,417 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:51,418 INFO L308 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2023-12-05 21:13:51,418 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 209 transitions, 801 flow [2023-12-05 21:13:51,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:51,419 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:51,419 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:51,419 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:13:51,419 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:51,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash 766166642, now seen corresponding path program 1 times [2023-12-05 21:13:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:51,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857556072] [2023-12-05 21:13:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:51,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:51,526 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:13:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:51,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857556072] [2023-12-05 21:13:51,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857556072] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:51,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236846348] [2023-12-05 21:13:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:51,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:51,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:51,528 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:13:51,543 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:13:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:51,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:13:51,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:51,607 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:13:51,670 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:13:51,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:51,749 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:13:51,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236846348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:51,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:51,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:13:51,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987826889] [2023-12-05 21:13:51,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:51,750 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:13:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:13:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:13:51,752 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 192 [2023-12-05 21:13:51,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 209 transitions, 801 flow. Second operand has 11 states, 11 states have (on average 119.63636363636364) internal successors, (1316), 11 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:51,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:51,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 192 [2023-12-05 21:13:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:56,084 INFO L124 PetriNetUnfolderBase]: 18270/38944 cut-off events. [2023-12-05 21:13:56,085 INFO L125 PetriNetUnfolderBase]: For 20920/24370 co-relation queries the response was YES. [2023-12-05 21:13:56,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114726 conditions, 38944 events. 18270/38944 cut-off events. For 20920/24370 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 408002 event pairs, 596 based on Foata normal form. 9/36212 useless extension candidates. Maximal degree in co-relation 12073. Up to 22293 conditions per place. [2023-12-05 21:13:56,434 INFO L140 encePairwiseOnDemand]: 182/192 looper letters, 120 selfloop transitions, 11 changer transitions 41/285 dead transitions. [2023-12-05 21:13:56,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 285 transitions, 1577 flow [2023-12-05 21:13:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:13:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:13:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1325 transitions. [2023-12-05 21:13:56,439 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6901041666666666 [2023-12-05 21:13:56,439 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1325 transitions. [2023-12-05 21:13:56,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1325 transitions. [2023-12-05 21:13:56,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:56,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1325 transitions. [2023-12-05 21:13:56,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 132.5) internal successors, (1325), 10 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:56,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:56,446 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:56,447 INFO L308 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2023-12-05 21:13:56,447 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 285 transitions, 1577 flow [2023-12-05 21:13:56,447 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 119.63636363636364) internal successors, (1316), 11 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:56,447 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:56,447 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:56,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-05 21:13:56,652 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:56,652 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:56,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1519513307, now seen corresponding path program 1 times [2023-12-05 21:13:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459440508] [2023-12-05 21:13:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459440508] [2023-12-05 21:13:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459440508] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:13:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427185901] [2023-12-05 21:13:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:56,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:56,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:13:56,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:13:56,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-05 21:13:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:56,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:13:56,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:13:56,948 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:13:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:57,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:13:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:13:57,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427185901] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:13:57,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:13:57,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:13:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204208303] [2023-12-05 21:13:57,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:13:57,314 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:13:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:13:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:13:57,316 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 192 [2023-12-05 21:13:57,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 285 transitions, 1577 flow. Second operand has 23 states, 23 states have (on average 119.82608695652173) internal successors, (2756), 23 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:57,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:57,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 192 [2023-12-05 21:13:57,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:13:59,025 INFO L124 PetriNetUnfolderBase]: 5490/10906 cut-off events. [2023-12-05 21:13:59,025 INFO L125 PetriNetUnfolderBase]: For 14530/17871 co-relation queries the response was YES. [2023-12-05 21:13:59,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40709 conditions, 10906 events. 5490/10906 cut-off events. For 14530/17871 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 93045 event pairs, 0 based on Foata normal form. 738/11537 useless extension candidates. Maximal degree in co-relation 4334. Up to 7466 conditions per place. [2023-12-05 21:13:59,113 INFO L140 encePairwiseOnDemand]: 185/192 looper letters, 160 selfloop transitions, 11 changer transitions 0/261 dead transitions. [2023-12-05 21:13:59,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 261 transitions, 1876 flow [2023-12-05 21:13:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:13:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:13:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1677 transitions. [2023-12-05 21:13:59,130 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.671875 [2023-12-05 21:13:59,130 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1677 transitions. [2023-12-05 21:13:59,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1677 transitions. [2023-12-05 21:13:59,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:13:59,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1677 transitions. [2023-12-05 21:13:59,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 129.0) internal successors, (1677), 13 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:59,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:59,155 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:59,155 INFO L308 CegarLoopForPetriNet]: 172 programPoint places, -16 predicate places. [2023-12-05 21:13:59,155 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 261 transitions, 1876 flow [2023-12-05 21:13:59,156 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 119.82608695652173) internal successors, (2756), 23 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:59,156 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:59,157 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:59,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-05 21:13:59,357 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:13:59,357 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:59,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash 139728469, now seen corresponding path program 1 times [2023-12-05 21:13:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377188208] [2023-12-05 21:13:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:59,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:13:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:13:59,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:13:59,394 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:13:59,394 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:13:59,394 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:13:59,395 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:13:59,395 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:13:59,395 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:13:59,395 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:13:59,395 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-05 21:13:59,396 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:13:59,396 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:13:59,423 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:13:59,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 225 transitions, 490 flow [2023-12-05 21:13:59,479 INFO L124 PetriNetUnfolderBase]: 86/659 cut-off events. [2023-12-05 21:13:59,479 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:13:59,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 659 events. 86/659 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2739 event pairs, 6 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 451. Up to 32 conditions per place. [2023-12-05 21:13:59,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 225 transitions, 490 flow [2023-12-05 21:13:59,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 225 transitions, 490 flow [2023-12-05 21:13:59,491 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:13:59,491 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;@36a67449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:13:59,491 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:13:59,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:13:59,493 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-12-05 21:13:59,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:13:59,493 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:13:59,493 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:13:59,494 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:13:59,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:13:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1440652615, now seen corresponding path program 1 times [2023-12-05 21:13:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:13:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080329236] [2023-12-05 21:13:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:13:59,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:13:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:13:59,524 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:13:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:13:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080329236] [2023-12-05 21:13:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080329236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:13:59,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:13:59,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:13:59,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309742049] [2023-12-05 21:13:59,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:13:59,526 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:13:59,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:13:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:13:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:13:59,527 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 225 [2023-12-05 21:13:59,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 225 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:13:59,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:13:59,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 225 [2023-12-05 21:13:59,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:33,001 INFO L124 PetriNetUnfolderBase]: 128961/269406 cut-off events. [2023-12-05 21:14:33,001 INFO L125 PetriNetUnfolderBase]: For 10376/10376 co-relation queries the response was YES. [2023-12-05 21:14:34,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444085 conditions, 269406 events. 128961/269406 cut-off events. For 10376/10376 co-relation queries the response was YES. Maximal size of possible extension queue 5637. Compared 3449051 event pairs, 90828 based on Foata normal form. 100078/355473 useless extension candidates. Maximal degree in co-relation 50204. Up to 121191 conditions per place. [2023-12-05 21:14:36,197 INFO L140 encePairwiseOnDemand]: 191/225 looper letters, 46 selfloop transitions, 1 changer transitions 29/214 dead transitions. [2023-12-05 21:14:36,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 214 transitions, 616 flow [2023-12-05 21:14:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-12-05 21:14:36,208 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8237037037037037 [2023-12-05 21:14:36,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-12-05 21:14:36,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-12-05 21:14:36,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:36,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-12-05 21:14:36,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:14:36,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call 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:36,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call 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:36,212 INFO L308 CegarLoopForPetriNet]: 200 programPoint places, -3 predicate places. [2023-12-05 21:14:36,212 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 214 transitions, 616 flow [2023-12-05 21:14:36,213 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call 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:36,213 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:36,213 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:36,213 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:14:36,213 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:14:36,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1440652616, now seen corresponding path program 1 times [2023-12-05 21:14:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014364380] [2023-12-05 21:14:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:36,326 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:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014364380] [2023-12-05 21:14:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014364380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325250623] [2023-12-05 21:14:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:36,327 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:36,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:36,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:36,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:36,328 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 225 [2023-12-05 21:14:36,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 214 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call 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:36,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:36,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 225 [2023-12-05 21:14:36,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand