/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_27-funptr_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:16:06,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:16:06,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:16:06,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:16:06,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:16:06,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:16:06,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:16:06,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:16:06,280 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:16:06,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:16:06,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:16:06,283 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:16:06,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:16:06,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:16:06,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:16:06,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:16:06,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:16:06,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:16:06,285 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:16:06,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:16:06,285 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:16:06,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:16:06,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:16:06,286 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:16:06,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:16:06,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:06,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:16:06,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:16:06,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:16:06,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:16:06,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:16:06,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:16:06,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:16:06,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:16:06,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:16:06,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:16:06,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:16:06,518 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:16:06,520 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:16:06,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_27-funptr_racing.i [2023-12-05 21:16:07,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:16:07,787 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:16:07,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_27-funptr_racing.i [2023-12-05 21:16:07,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a998a7134/a60caf6992f64fe284d1b942e0f49857/FLAGeb4014307 [2023-12-05 21:16:07,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a998a7134/a60caf6992f64fe284d1b942e0f49857 [2023-12-05 21:16:07,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:16:07,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:16:07,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:07,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:16:07,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:16:07,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:07" (1/1) ... [2023-12-05 21:16:07,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b36515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:07, skipping insertion in model container [2023-12-05 21:16:07,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:07" (1/1) ... [2023-12-05 21:16:07,874 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:16:08,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:08,206 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:16:08,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:08,303 WARN L675 CHandler]: The function g is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:16:08,308 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:16:08,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08 WrapperNode [2023-12-05 21:16:08,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:08,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:08,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:16:08,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:16:08,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,360 INFO L138 Inliner]: procedures = 274, calls = 53, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 179 [2023-12-05 21:16:08,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:08,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:16:08,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:16:08,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:16:08,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:16:08,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:16:08,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:16:08,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:16:08,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (1/1) ... [2023-12-05 21:16:08,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:08,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:08,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:16:08,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:16:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:16:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:16:08,446 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:16:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:16:08,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:16:08,447 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:16:08,594 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:16:08,596 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:16:08,871 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:16:08,898 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:16:08,898 INFO L309 CfgBuilder]: Removed 16 assume(true) statements. [2023-12-05 21:16:08,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:08 BoogieIcfgContainer [2023-12-05 21:16:08,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:16:08,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:16:08,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:16:08,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:16:08,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:16:07" (1/3) ... [2023-12-05 21:16:08,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff350ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:08, skipping insertion in model container [2023-12-05 21:16:08,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:08" (2/3) ... [2023-12-05 21:16:08,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff350ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:08, skipping insertion in model container [2023-12-05 21:16:08,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:08" (3/3) ... [2023-12-05 21:16:08,907 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2023-12-05 21:16:08,920 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:16:08,920 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:16:08,920 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:16:08,963 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:16:09,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 167 transitions, 341 flow [2023-12-05 21:16:09,060 INFO L124 PetriNetUnfolderBase]: 26/220 cut-off events. [2023-12-05 21:16:09,061 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:16:09,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 220 events. 26/220 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 705 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 127. Up to 4 conditions per place. [2023-12-05 21:16:09,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 167 transitions, 341 flow [2023-12-05 21:16:09,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 167 transitions, 341 flow [2023-12-05 21:16:09,078 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:09,083 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;@1ace9d1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:09,083 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:09,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:09,090 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2023-12-05 21:16:09,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:09,091 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:09,091 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] [2023-12-05 21:16:09,092 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:09,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -901713646, now seen corresponding path program 1 times [2023-12-05 21:16:09,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:09,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206485387] [2023-12-05 21:16:09,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:09,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:09,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206485387] [2023-12-05 21:16:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206485387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:09,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:09,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700726798] [2023-12-05 21:16:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:09,325 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:09,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:09,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:09,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:09,363 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 167 [2023-12-05 21:16:09,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 167 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:09,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:09,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 167 [2023-12-05 21:16:09,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:09,589 INFO L124 PetriNetUnfolderBase]: 168/952 cut-off events. [2023-12-05 21:16:09,589 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:16:09,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 952 events. 168/952 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6584 event pairs, 120 based on Foata normal form. 177/1076 useless extension candidates. Maximal degree in co-relation 1207. Up to 275 conditions per place. [2023-12-05 21:16:09,597 INFO L140 encePairwiseOnDemand]: 145/167 looper letters, 41 selfloop transitions, 2 changer transitions 4/156 dead transitions. [2023-12-05 21:16:09,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 413 flow [2023-12-05 21:16:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-12-05 21:16:09,613 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8223552894211577 [2023-12-05 21:16:09,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-12-05 21:16:09,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-12-05 21:16:09,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:09,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-12-05 21:16:09,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:09,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:09,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:09,635 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, -3 predicate places. [2023-12-05 21:16:09,635 INFO L500 AbstractCegarLoop]: Abstraction has has 147 places, 156 transitions, 413 flow [2023-12-05 21:16:09,636 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:09,636 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:09,636 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] [2023-12-05 21:16:09,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:16:09,636 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:09,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash -901713645, now seen corresponding path program 1 times [2023-12-05 21:16:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886721206] [2023-12-05 21:16:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:09,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886721206] [2023-12-05 21:16:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886721206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563660937] [2023-12-05 21:16:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:09,818 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:09,821 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 167 [2023-12-05 21:16:09,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 156 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 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:16:09,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:09,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 167 [2023-12-05 21:16:09,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:10,020 INFO L124 PetriNetUnfolderBase]: 218/970 cut-off events. [2023-12-05 21:16:10,020 INFO L125 PetriNetUnfolderBase]: For 200/206 co-relation queries the response was YES. [2023-12-05 21:16:10,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 970 events. 218/970 cut-off events. For 200/206 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6614 event pairs, 12 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1762. Up to 380 conditions per place. [2023-12-05 21:16:10,027 INFO L140 encePairwiseOnDemand]: 161/167 looper letters, 66 selfloop transitions, 4 changer transitions 8/182 dead transitions. [2023-12-05 21:16:10,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 182 transitions, 671 flow [2023-12-05 21:16:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-12-05 21:16:10,029 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7365269461077845 [2023-12-05 21:16:10,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-12-05 21:16:10,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-12-05 21:16:10,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:10,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-12-05 21:16:10,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,033 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,034 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, 0 predicate places. [2023-12-05 21:16:10,034 INFO L500 AbstractCegarLoop]: Abstraction has has 150 places, 182 transitions, 671 flow [2023-12-05 21:16:10,035 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 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:16:10,035 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:10,035 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] [2023-12-05 21:16:10,035 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:16:10,035 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:10,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1015821556, now seen corresponding path program 1 times [2023-12-05 21:16:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:10,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577721116] [2023-12-05 21:16:10,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577721116] [2023-12-05 21:16:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577721116] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381101939] [2023-12-05 21:16:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:10,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:10,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:16:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:10,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:10,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:10,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:16:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:10,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381101939] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:10,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855046148] [2023-12-05 21:16:10,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:10,685 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:10,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:10,688 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 167 [2023-12-05 21:16:10,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 182 transitions, 671 flow. Second operand has 14 states, 14 states have (on average 107.57142857142857) internal successors, (1506), 14 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:10,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 167 [2023-12-05 21:16:10,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:10,829 INFO L124 PetriNetUnfolderBase]: 61/269 cut-off events. [2023-12-05 21:16:10,829 INFO L125 PetriNetUnfolderBase]: For 196/239 co-relation queries the response was YES. [2023-12-05 21:16:10,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 269 events. 61/269 cut-off events. For 196/239 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1120 event pairs, 0 based on Foata normal form. 19/286 useless extension candidates. Maximal degree in co-relation 564. Up to 88 conditions per place. [2023-12-05 21:16:10,831 INFO L140 encePairwiseOnDemand]: 160/167 looper letters, 59 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2023-12-05 21:16:10,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 139 transitions, 654 flow [2023-12-05 21:16:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2023-12-05 21:16:10,833 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6852010265183918 [2023-12-05 21:16:10,833 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2023-12-05 21:16:10,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2023-12-05 21:16:10,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:10,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2023-12-05 21:16:10,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,837 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,838 INFO L308 CegarLoopForPetriNet]: 150 programPoint places, -36 predicate places. [2023-12-05 21:16:10,838 INFO L500 AbstractCegarLoop]: Abstraction has has 114 places, 139 transitions, 654 flow [2023-12-05 21:16:10,839 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 107.57142857142857) internal successors, (1506), 14 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:10,839 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:10,839 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] [2023-12-05 21:16:10,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-05 21:16:11,044 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:11,045 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:11,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1425697660, now seen corresponding path program 1 times [2023-12-05 21:16:11,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723849580] [2023-12-05 21:16:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:11,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:11,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:11,100 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:11,101 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:16:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:16:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:16:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:16:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:16:11,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:16:11,105 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:16:11,107 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:11,107 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:16:11,141 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:16:11,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 238 transitions, 492 flow [2023-12-05 21:16:11,182 INFO L124 PetriNetUnfolderBase]: 48/372 cut-off events. [2023-12-05 21:16:11,182 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:16:11,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 372 events. 48/372 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1463 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 222. Up to 8 conditions per place. [2023-12-05 21:16:11,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 238 transitions, 492 flow [2023-12-05 21:16:11,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 238 transitions, 492 flow [2023-12-05 21:16:11,188 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:11,189 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;@1ace9d1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:11,189 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:11,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:11,191 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2023-12-05 21:16:11,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:11,191 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:11,191 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] [2023-12-05 21:16:11,192 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:11,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1405699456, now seen corresponding path program 1 times [2023-12-05 21:16:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671581826] [2023-12-05 21:16:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:11,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671581826] [2023-12-05 21:16:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671581826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202265513] [2023-12-05 21:16:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:11,219 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:11,220 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 238 [2023-12-05 21:16:11,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 238 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:11,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:11,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 238 [2023-12-05 21:16:11,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:12,820 INFO L124 PetriNetUnfolderBase]: 4645/14913 cut-off events. [2023-12-05 21:16:12,820 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-12-05 21:16:12,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22136 conditions, 14913 events. 4645/14913 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 169415 event pairs, 3444 based on Foata normal form. 3955/18125 useless extension candidates. Maximal degree in co-relation 1963. Up to 5535 conditions per place. [2023-12-05 21:16:12,913 INFO L140 encePairwiseOnDemand]: 204/238 looper letters, 71 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2023-12-05 21:16:12,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 227 transitions, 616 flow [2023-12-05 21:16:12,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2023-12-05 21:16:12,915 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8361344537815126 [2023-12-05 21:16:12,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 597 transitions. [2023-12-05 21:16:12,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions. [2023-12-05 21:16:12,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:12,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions. [2023-12-05 21:16:12,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:12,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:12,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:12,920 INFO L308 CegarLoopForPetriNet]: 209 programPoint places, -3 predicate places. [2023-12-05 21:16:12,955 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 227 transitions, 616 flow [2023-12-05 21:16:12,955 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:12,955 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:12,955 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] [2023-12-05 21:16:12,955 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:16:12,956 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:12,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1405699455, now seen corresponding path program 1 times [2023-12-05 21:16:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623300585] [2023-12-05 21:16:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:13,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623300585] [2023-12-05 21:16:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623300585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:13,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053396012] [2023-12-05 21:16:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:13,009 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:13,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:13,010 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 238 [2023-12-05 21:16:13,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 227 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:13,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:13,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 238 [2023-12-05 21:16:13,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:14,619 INFO L124 PetriNetUnfolderBase]: 6114/16200 cut-off events. [2023-12-05 21:16:14,619 INFO L125 PetriNetUnfolderBase]: For 3554/3638 co-relation queries the response was YES. [2023-12-05 21:16:14,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34639 conditions, 16200 events. 6114/16200 cut-off events. For 3554/3638 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 175238 event pairs, 2388 based on Foata normal form. 0/14797 useless extension candidates. Maximal degree in co-relation 3265. Up to 8527 conditions per place. [2023-12-05 21:16:14,799 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 114 selfloop transitions, 4 changer transitions 0/267 dead transitions. [2023-12-05 21:16:14,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 267 transitions, 1006 flow [2023-12-05 21:16:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2023-12-05 21:16:14,801 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2023-12-05 21:16:14,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 700 transitions. [2023-12-05 21:16:14,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions. [2023-12-05 21:16:14,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:14,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions. [2023-12-05 21:16:14,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:14,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:14,804 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:14,805 INFO L308 CegarLoopForPetriNet]: 209 programPoint places, 0 predicate places. [2023-12-05 21:16:14,805 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 267 transitions, 1006 flow [2023-12-05 21:16:14,805 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:14,805 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:14,805 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] [2023-12-05 21:16:14,806 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:16:14,806 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:14,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:14,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1415627011, now seen corresponding path program 1 times [2023-12-05 21:16:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:14,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328897568] [2023-12-05 21:16:14,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:14,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328897568] [2023-12-05 21:16:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328897568] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625737160] [2023-12-05 21:16:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:14,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:14,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:14,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:14,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:16:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:14,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:14,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:14,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:16:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:15,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:15,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625737160] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:15,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:15,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662006965] [2023-12-05 21:16:15,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:15,126 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:15,128 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 238 [2023-12-05 21:16:15,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 267 transitions, 1006 flow. Second operand has 14 states, 14 states have (on average 152.57142857142858) internal successors, (2136), 14 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:15,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 238 [2023-12-05 21:16:15,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:15,777 INFO L124 PetriNetUnfolderBase]: 1803/4576 cut-off events. [2023-12-05 21:16:15,777 INFO L125 PetriNetUnfolderBase]: For 3786/4662 co-relation queries the response was YES. [2023-12-05 21:16:15,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12346 conditions, 4576 events. 1803/4576 cut-off events. For 3786/4662 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 40316 event pairs, 75 based on Foata normal form. 13/4503 useless extension candidates. Maximal degree in co-relation 1221. Up to 2649 conditions per place. [2023-12-05 21:16:15,802 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 146 selfloop transitions, 8 changer transitions 0/274 dead transitions. [2023-12-05 21:16:15,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 274 transitions, 1460 flow [2023-12-05 21:16:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:16:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:16:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1658 transitions. [2023-12-05 21:16:15,806 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6966386554621848 [2023-12-05 21:16:15,806 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1658 transitions. [2023-12-05 21:16:15,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1658 transitions. [2023-12-05 21:16:15,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:15,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1658 transitions. [2023-12-05 21:16:15,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 165.8) internal successors, (1658), 10 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,812 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,813 INFO L308 CegarLoopForPetriNet]: 209 programPoint places, -33 predicate places. [2023-12-05 21:16:15,813 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 274 transitions, 1460 flow [2023-12-05 21:16:15,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 152.57142857142858) internal successors, (2136), 14 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:15,813 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:15,814 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] [2023-12-05 21:16:15,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:16,018 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-05 21:16:16,019 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:16,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2146014069, now seen corresponding path program 1 times [2023-12-05 21:16:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:16,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459649849] [2023-12-05 21:16:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:16,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:16,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:16,057 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:16,057 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:16:16,057 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:16:16,057 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:16:16,057 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:16:16,057 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:16:16,058 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:16:16,058 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:16:16,058 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:16,058 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:16:16,092 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:16:16,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 309 transitions, 645 flow [2023-12-05 21:16:16,159 INFO L124 PetriNetUnfolderBase]: 75/563 cut-off events. [2023-12-05 21:16:16,159 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:16:16,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 563 events. 75/563 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2453 event pairs, 1 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 380. Up to 16 conditions per place. [2023-12-05 21:16:16,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 268 places, 309 transitions, 645 flow [2023-12-05 21:16:16,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 309 transitions, 645 flow [2023-12-05 21:16:16,168 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:16,168 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;@1ace9d1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:16,168 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:16,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:16,170 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2023-12-05 21:16:16,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:16,170 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:16,170 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] [2023-12-05 21:16:16,170 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:16,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1338190731, now seen corresponding path program 1 times [2023-12-05 21:16:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:16,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133836185] [2023-12-05 21:16:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:16,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:16,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133836185] [2023-12-05 21:16:16,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133836185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:16,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:16,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294033666] [2023-12-05 21:16:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:16,194 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:16,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:16,195 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 309 [2023-12-05 21:16:16,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 309 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:16,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:16,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 309 [2023-12-05 21:16:16,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:43,804 INFO L124 PetriNetUnfolderBase]: 94301/230773 cut-off events. [2023-12-05 21:16:43,805 INFO L125 PetriNetUnfolderBase]: For 3121/3121 co-relation queries the response was YES. [2023-12-05 21:16:45,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360050 conditions, 230773 events. 94301/230773 cut-off events. For 3121/3121 co-relation queries the response was YES. Maximal size of possible extension queue 5661. Compared 3299850 event pairs, 70573 based on Foata normal form. 74203/295068 useless extension candidates. Maximal degree in co-relation 22119. Up to 98392 conditions per place. [2023-12-05 21:16:46,401 INFO L140 encePairwiseOnDemand]: 263/309 looper letters, 97 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2023-12-05 21:16:46,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 298 transitions, 821 flow [2023-12-05 21:16:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2023-12-05 21:16:46,404 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8435814455231931 [2023-12-05 21:16:46,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 782 transitions. [2023-12-05 21:16:46,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 782 transitions. [2023-12-05 21:16:46,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:46,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 782 transitions. [2023-12-05 21:16:46,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,408 INFO L308 CegarLoopForPetriNet]: 268 programPoint places, -3 predicate places. [2023-12-05 21:16:46,408 INFO L500 AbstractCegarLoop]: Abstraction has has 265 places, 298 transitions, 821 flow [2023-12-05 21:16:46,408 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,408 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:46,408 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] [2023-12-05 21:16:46,408 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:16:46,408 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:46,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1338190730, now seen corresponding path program 1 times [2023-12-05 21:16:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763641700] [2023-12-05 21:16:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763641700] [2023-12-05 21:16:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763641700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:46,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025757748] [2023-12-05 21:16:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:46,453 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:46,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:46,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:46,454 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 309 [2023-12-05 21:16:46,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 298 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:46,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:46,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 309 [2023-12-05 21:16:46,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand