/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 -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:02:05,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:02:05,850 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-09 15:02:05,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:02:05,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:02:05,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:02:05,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:02:05,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:02:05,882 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:02:05,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:02:05,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:02:05,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:02:05,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:02:05,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:02:05,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:02:05,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:02:05,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:02:05,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:02:05,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:02:05,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:02:05,887 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:02:05,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:02:05,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:02:05,888 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:02:05,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:02:05,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:02:05,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:02:05,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:02:05,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:02:05,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:02:05,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:02:05,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:02:05,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:02:05,890 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 [2023-12-09 15:02:06,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:02:06,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:02:06,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:02:06,172 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:02:06,173 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:02:06,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2023-12-09 15:02:07,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:02:07,429 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:02:07,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2023-12-09 15:02:07,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b411f62a4/003db6a5ca5c48c3852f78061e2d03f0/FLAG5db5ef7ba [2023-12-09 15:02:07,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b411f62a4/003db6a5ca5c48c3852f78061e2d03f0 [2023-12-09 15:02:07,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:02:07,466 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:02:07,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:02:07,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:02:07,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:02:07,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:02:07" (1/1) ... [2023-12-09 15:02:07,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eee53cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:07, skipping insertion in model container [2023-12-09 15:02:07,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:02:07" (1/1) ... [2023-12-09 15:02:07,592 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:02:07,998 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2023-12-09 15:02:08,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:02:08,058 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:02:08,090 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2023-12-09 15:02:08,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:02:08,135 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:02:08,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08 WrapperNode [2023-12-09 15:02:08,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:02:08,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:02:08,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:02:08,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:02:08,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,186 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2023-12-09 15:02:08,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:02:08,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:02:08,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:02:08,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:02:08,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:02:08,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:02:08,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:02:08,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:02:08,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (1/1) ... [2023-12-09 15:02:08,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:02:08,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:08,262 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-09 15:02:08,296 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-09 15:02:08,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:02:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:02:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 15:02:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:02:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:02:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-09 15:02:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-09 15:02:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:02:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:02:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 15:02:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:02:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:02:08,305 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:02:08,437 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:02:08,438 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:02:08,626 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:02:08,660 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:02:08,660 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-09 15:02:08,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:02:08 BoogieIcfgContainer [2023-12-09 15:02:08,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:02:08,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:02:08,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:02:08,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:02:08,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:02:07" (1/3) ... [2023-12-09 15:02:08,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad1c6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:02:08, skipping insertion in model container [2023-12-09 15:02:08,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:08" (2/3) ... [2023-12-09 15:02:08,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad1c6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:02:08, skipping insertion in model container [2023-12-09 15:02:08,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:02:08" (3/3) ... [2023-12-09 15:02:08,692 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2023-12-09 15:02:08,704 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:02:08,704 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:02:08,704 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:02:08,737 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-09 15:02:08,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 127 transitions, 261 flow [2023-12-09 15:02:08,807 INFO L124 PetriNetUnfolderBase]: 17/169 cut-off events. [2023-12-09 15:02:08,807 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 15:02:08,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 169 events. 17/169 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 424 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2023-12-09 15:02:08,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 127 transitions, 261 flow [2023-12-09 15:02:08,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 122 transitions, 248 flow [2023-12-09 15:02:08,831 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:08,850 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;@51727910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:08,850 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:08,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:08,875 INFO L124 PetriNetUnfolderBase]: 3/83 cut-off events. [2023-12-09 15:02:08,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:08,875 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:08,876 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:08,876 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:08,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 662631060, now seen corresponding path program 1 times [2023-12-09 15:02:08,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:08,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69265858] [2023-12-09 15:02:08,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:08,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:09,092 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-09 15:02:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69265858] [2023-12-09 15:02:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69265858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229611161] [2023-12-09 15:02:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:09,100 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:09,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:09,121 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 127 [2023-12-09 15:02:09,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 122 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:09,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 127 [2023-12-09 15:02:09,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:09,206 INFO L124 PetriNetUnfolderBase]: 66/442 cut-off events. [2023-12-09 15:02:09,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:09,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 442 events. 66/442 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2137 event pairs, 6 based on Foata normal form. 69/478 useless extension candidates. Maximal degree in co-relation 542. Up to 132 conditions per place. [2023-12-09 15:02:09,212 INFO L140 encePairwiseOnDemand]: 113/127 looper letters, 23 selfloop transitions, 2 changer transitions 16/118 dead transitions. [2023-12-09 15:02:09,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 296 flow [2023-12-09 15:02:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-12-09 15:02:09,226 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.863517060367454 [2023-12-09 15:02:09,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-12-09 15:02:09,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-12-09 15:02:09,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:09,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-12-09 15:02:09,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,240 INFO L308 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2023-12-09 15:02:09,241 INFO L500 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 296 flow [2023-12-09 15:02:09,241 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,241 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:09,241 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:09,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:02:09,242 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:09,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash -333134150, now seen corresponding path program 1 times [2023-12-09 15:02:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089718312] [2023-12-09 15:02:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:09,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:09,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:09,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:09,331 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:09,332 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:09,333 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:09,333 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:02:09,334 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 15:02:09,338 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:09,338 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 15:02:09,374 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:02:09,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 165 transitions, 346 flow [2023-12-09 15:02:09,411 INFO L124 PetriNetUnfolderBase]: 31/275 cut-off events. [2023-12-09 15:02:09,411 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-09 15:02:09,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 275 events. 31/275 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 879 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-12-09 15:02:09,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 165 transitions, 346 flow [2023-12-09 15:02:09,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 165 transitions, 346 flow [2023-12-09 15:02:09,418 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:09,419 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;@51727910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:09,419 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:09,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:09,450 INFO L124 PetriNetUnfolderBase]: 3/83 cut-off events. [2023-12-09 15:02:09,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:09,450 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:09,450 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:09,450 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:09,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash -660339655, now seen corresponding path program 1 times [2023-12-09 15:02:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019779380] [2023-12-09 15:02:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:09,497 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-09 15:02:09,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019779380] [2023-12-09 15:02:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019779380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:09,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077050023] [2023-12-09 15:02:09,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:09,498 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:09,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:09,499 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 165 [2023-12-09 15:02:09,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 165 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:09,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 165 [2023-12-09 15:02:09,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:09,928 INFO L124 PetriNetUnfolderBase]: 1058/3908 cut-off events. [2023-12-09 15:02:09,928 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-12-09 15:02:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5701 conditions, 3908 events. 1058/3908 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 34891 event pairs, 856 based on Foata normal form. 878/4474 useless extension candidates. Maximal degree in co-relation 725. Up to 1728 conditions per place. [2023-12-09 15:02:09,945 INFO L140 encePairwiseOnDemand]: 145/165 looper letters, 32 selfloop transitions, 2 changer transitions 22/157 dead transitions. [2023-12-09 15:02:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 157 transitions, 408 flow [2023-12-09 15:02:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-12-09 15:02:09,948 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2023-12-09 15:02:09,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-12-09 15:02:09,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-12-09 15:02:09,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:09,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-12-09 15:02:09,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,958 INFO L308 CegarLoopForPetriNet]: 151 programPoint places, 1 predicate places. [2023-12-09 15:02:09,959 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 157 transitions, 408 flow [2023-12-09 15:02:09,959 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:09,959 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:09,959 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:09,959 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:02:09,959 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:09,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash 23480088, now seen corresponding path program 1 times [2023-12-09 15:02:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:09,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351284138] [2023-12-09 15:02:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351284138] [2023-12-09 15:02:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351284138] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:10,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389569262] [2023-12-09 15:02:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:10,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:10,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:10,124 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-09 15:02:10,173 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-09 15:02:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:10,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:10,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:10,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:10,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389569262] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:10,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:10,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131143903] [2023-12-09 15:02:10,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:10,308 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:10,310 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 165 [2023-12-09 15:02:10,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 157 transitions, 408 flow. Second operand has 10 states, 10 states have (on average 119.6) internal successors, (1196), 10 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:10,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:10,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 165 [2023-12-09 15:02:10,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:10,549 INFO L124 PetriNetUnfolderBase]: 492/1342 cut-off events. [2023-12-09 15:02:10,549 INFO L125 PetriNetUnfolderBase]: For 354/620 co-relation queries the response was YES. [2023-12-09 15:02:10,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 1342 events. 492/1342 cut-off events. For 354/620 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8809 event pairs, 0 based on Foata normal form. 8/1312 useless extension candidates. Maximal degree in co-relation 392. Up to 754 conditions per place. [2023-12-09 15:02:10,557 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 75 selfloop transitions, 7 changer transitions 0/170 dead transitions. [2023-12-09 15:02:10,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 170 transitions, 674 flow [2023-12-09 15:02:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:02:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:02:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1137 transitions. [2023-12-09 15:02:10,560 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7656565656565657 [2023-12-09 15:02:10,560 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1137 transitions. [2023-12-09 15:02:10,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1137 transitions. [2023-12-09 15:02:10,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:10,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1137 transitions. [2023-12-09 15:02:10,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.33333333333333) internal successors, (1137), 9 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:10,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 165.0) internal successors, (1650), 10 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:10,565 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 165.0) internal successors, (1650), 10 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:10,565 INFO L308 CegarLoopForPetriNet]: 151 programPoint places, -27 predicate places. [2023-12-09 15:02:10,565 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 170 transitions, 674 flow [2023-12-09 15:02:10,566 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 119.6) internal successors, (1196), 10 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:10,566 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:10,566 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:10,572 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-09 15:02:10,771 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:10,772 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:10,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 542722500, now seen corresponding path program 1 times [2023-12-09 15:02:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700151943] [2023-12-09 15:02:10,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:10,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:10,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:10,797 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:10,798 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:10,798 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:10,798 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:02:10,798 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:02:10,798 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:10,799 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 15:02:10,819 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:02:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 203 transitions, 433 flow [2023-12-09 15:02:10,879 INFO L124 PetriNetUnfolderBase]: 50/416 cut-off events. [2023-12-09 15:02:10,879 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-09 15:02:10,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 416 events. 50/416 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1460 event pairs, 1 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 283. Up to 16 conditions per place. [2023-12-09 15:02:10,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 203 transitions, 433 flow [2023-12-09 15:02:10,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 203 transitions, 433 flow [2023-12-09 15:02:10,884 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:10,885 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;@51727910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:10,885 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:10,889 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:10,889 INFO L124 PetriNetUnfolderBase]: 3/83 cut-off events. [2023-12-09 15:02:10,889 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:10,889 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:10,889 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:10,889 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:10,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash 575316996, now seen corresponding path program 1 times [2023-12-09 15:02:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552167592] [2023-12-09 15:02:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:10,917 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-09 15:02:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552167592] [2023-12-09 15:02:10,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552167592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538010529] [2023-12-09 15:02:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:10,918 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:10,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:10,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:10,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:10,919 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 203 [2023-12-09 15:02:10,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 203 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:10,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:10,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 203 [2023-12-09 15:02:10,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:14,820 INFO L124 PetriNetUnfolderBase]: 11851/34572 cut-off events. [2023-12-09 15:02:14,820 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2023-12-09 15:02:14,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51857 conditions, 34572 events. 11851/34572 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 419546 event pairs, 7555 based on Foata normal form. 9294/42864 useless extension candidates. Maximal degree in co-relation 6001. Up to 16847 conditions per place. [2023-12-09 15:02:15,061 INFO L140 encePairwiseOnDemand]: 177/203 looper letters, 39 selfloop transitions, 2 changer transitions 23/189 dead transitions. [2023-12-09 15:02:15,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 189 transitions, 499 flow [2023-12-09 15:02:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-12-09 15:02:15,063 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2023-12-09 15:02:15,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-12-09 15:02:15,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-12-09 15:02:15,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:15,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-12-09 15:02:15,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:15,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:15,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:15,067 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, 1 predicate places. [2023-12-09 15:02:15,067 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 189 transitions, 499 flow [2023-12-09 15:02:15,067 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:15,067 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:15,067 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:15,067 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:02:15,068 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:15,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1258045345, now seen corresponding path program 1 times [2023-12-09 15:02:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:15,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094739418] [2023-12-09 15:02:15,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:15,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094739418] [2023-12-09 15:02:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094739418] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:15,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546863460] [2023-12-09 15:02:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:15,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:15,143 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-09 15:02:15,171 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-09 15:02:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:15,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:15,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:15,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546863460] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:15,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:15,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496632446] [2023-12-09 15:02:15,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:15,283 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:15,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:15,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:15,285 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 203 [2023-12-09 15:02:15,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 189 transitions, 499 flow. Second operand has 10 states, 10 states have (on average 143.6) internal successors, (1436), 10 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:15,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:15,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 203 [2023-12-09 15:02:15,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:18,877 INFO L124 PetriNetUnfolderBase]: 12227/32098 cut-off events. [2023-12-09 15:02:18,877 INFO L125 PetriNetUnfolderBase]: For 6807/12820 co-relation queries the response was YES. [2023-12-09 15:02:18,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66844 conditions, 32098 events. 12227/32098 cut-off events. For 6807/12820 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 359660 event pairs, 1781 based on Foata normal form. 4/30023 useless extension candidates. Maximal degree in co-relation 7422. Up to 16943 conditions per place. [2023-12-09 15:02:19,109 INFO L140 encePairwiseOnDemand]: 197/203 looper letters, 106 selfloop transitions, 9 changer transitions 23/262 dead transitions. [2023-12-09 15:02:19,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 262 transitions, 1029 flow [2023-12-09 15:02:19,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:02:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:02:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1392 transitions. [2023-12-09 15:02:19,112 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-12-09 15:02:19,113 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1392 transitions. [2023-12-09 15:02:19,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1392 transitions. [2023-12-09 15:02:19,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:19,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1392 transitions. [2023-12-09 15:02:19,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 154.66666666666666) internal successors, (1392), 9 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,119 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,121 INFO L308 CegarLoopForPetriNet]: 184 programPoint places, 9 predicate places. [2023-12-09 15:02:19,121 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 262 transitions, 1029 flow [2023-12-09 15:02:19,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 143.6) internal successors, (1436), 10 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,122 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:19,122 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:19,130 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-09 15:02:19,327 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-09 15:02:19,328 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:19,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1573755497, now seen corresponding path program 1 times [2023-12-09 15:02:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:19,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803137343] [2023-12-09 15:02:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:19,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:19,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:19,382 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:19,382 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:19,382 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:19,382 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:02:19,382 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:02:19,383 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:19,383 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 15:02:19,415 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-09 15:02:19,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 241 transitions, 522 flow [2023-12-09 15:02:19,463 INFO L124 PetriNetUnfolderBase]: 81/629 cut-off events. [2023-12-09 15:02:19,463 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-09 15:02:19,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 629 events. 81/629 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2564 event pairs, 6 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 436. Up to 32 conditions per place. [2023-12-09 15:02:19,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 241 transitions, 522 flow [2023-12-09 15:02:19,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 241 transitions, 522 flow [2023-12-09 15:02:19,474 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:19,475 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;@51727910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:19,475 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:19,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:19,478 INFO L124 PetriNetUnfolderBase]: 5/90 cut-off events. [2023-12-09 15:02:19,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:19,478 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:19,478 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:19,478 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:19,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 74633717, now seen corresponding path program 1 times [2023-12-09 15:02:19,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:19,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437373526] [2023-12-09 15:02:19,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:19,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:19,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437373526] [2023-12-09 15:02:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437373526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:19,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136474584] [2023-12-09 15:02:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:19,505 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:19,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:19,506 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 241 [2023-12-09 15:02:19,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 241 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:19,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 241 [2023-12-09 15:02:19,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:56,320 INFO L124 PetriNetUnfolderBase]: 116073/285467 cut-off events. [2023-12-09 15:02:56,320 INFO L125 PetriNetUnfolderBase]: For 11989/11989 co-relation queries the response was YES. [2023-12-09 15:02:58,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442151 conditions, 285467 events. 116073/285467 cut-off events. For 11989/11989 co-relation queries the response was YES. Maximal size of possible extension queue 5999. Compared 4102489 event pairs, 84882 based on Foata normal form. 87631/366100 useless extension candidates. Maximal degree in co-relation 52716. Up to 152541 conditions per place. [2023-12-09 15:02:59,543 INFO L140 encePairwiseOnDemand]: 209/241 looper letters, 46 selfloop transitions, 2 changer transitions 24/221 dead transitions. [2023-12-09 15:02:59,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 221 transitions, 592 flow [2023-12-09 15:02:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2023-12-09 15:02:59,548 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8160442600276625 [2023-12-09 15:02:59,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 590 transitions. [2023-12-09 15:02:59,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 590 transitions. [2023-12-09 15:02:59,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:59,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 590 transitions. [2023-12-09 15:02:59,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:59,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:59,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:59,555 INFO L308 CegarLoopForPetriNet]: 217 programPoint places, 1 predicate places. [2023-12-09 15:02:59,555 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 592 flow [2023-12-09 15:02:59,556 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:59,556 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:59,556 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:59,556 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:02:59,556 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:59,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash -693762036, now seen corresponding path program 1 times [2023-12-09 15:02:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:59,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194875284] [2023-12-09 15:02:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:59,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:59,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194875284] [2023-12-09 15:02:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194875284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:59,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166182172] [2023-12-09 15:02:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:59,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:59,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:59,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:02:59,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:02:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:59,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:59,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:59,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166182172] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:59,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:59,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034070268] [2023-12-09 15:02:59,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:59,766 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:59,767 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 241 [2023-12-09 15:02:59,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 592 flow. Second operand has 10 states, 10 states have (on average 167.6) internal successors, (1676), 10 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:59,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:59,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 241 [2023-12-09 15:02:59,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand