/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_36-indirect_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:03:05,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:03:05,935 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:03:05,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:03:05,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:03:05,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:03:05,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:03:05,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:03:05,957 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:03:05,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:03:05,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:03:05,960 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:03:05,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:03:05,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:03:05,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:03:05,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:03:05,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:03:05,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:03:05,962 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:03:05,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:03:05,963 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:03:05,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:03:05,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:03:05,964 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:03:05,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:03:05,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:03:05,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:03:05,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:03:05,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:03:05,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:03:05,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:03:05,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:03:05,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:03:05,967 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:03:06,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:03:06,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:03:06,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:03:06,194 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:03:06,195 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:03:06,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_36-indirect_racefree.i [2023-12-09 15:03:07,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:03:07,536 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:03:07,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_36-indirect_racefree.i [2023-12-09 15:03:07,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7420aeb2e/2f435b22ac2b4dc7ba7c4370f385f59f/FLAG69c27b0e3 [2023-12-09 15:03:07,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7420aeb2e/2f435b22ac2b4dc7ba7c4370f385f59f [2023-12-09 15:03:07,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:03:07,568 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:03:07,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:03:07,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:03:07,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:03:07,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:07,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1201d369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07, skipping insertion in model container [2023-12-09 15:03:07,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:07,609 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:03:07,868 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_36-indirect_racefree.i[30176,30189] [2023-12-09 15:03:07,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:03:07,900 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:03:07,954 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_36-indirect_racefree.i[30176,30189] [2023-12-09 15:03:07,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:03:07,999 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:03:08,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07 WrapperNode [2023-12-09 15:03:08,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:03:08,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:03:08,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:03:08,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:03:08,007 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:03:07" (1/1) ... [2023-12-09 15:03:08,022 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:03:07" (1/1) ... [2023-12-09 15:03:08,040 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-12-09 15:03:08,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:03:08,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:03:08,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:03:08,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:03:08,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:03:08,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:03:08,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:03:08,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:03:08,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (1/1) ... [2023-12-09 15:03:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:03:08,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:08,089 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:03:08,138 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:03:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:03:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:03:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 15:03:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:03:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:03:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-09 15:03:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-09 15:03:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:03:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:03:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 15:03:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:03:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:03:08,159 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:03:08,294 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:03:08,296 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:03:08,505 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:03:08,539 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:03:08,539 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-09 15:03:08,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:03:08 BoogieIcfgContainer [2023-12-09 15:03:08,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:03:08,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:03:08,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:03:08,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:03:08,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:03:07" (1/3) ... [2023-12-09 15:03:08,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6a4544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:03:08, skipping insertion in model container [2023-12-09 15:03:08,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:07" (2/3) ... [2023-12-09 15:03:08,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6a4544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:03:08, skipping insertion in model container [2023-12-09 15:03:08,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:03:08" (3/3) ... [2023-12-09 15:03:08,547 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2023-12-09 15:03:08,560 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:03:08,560 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:03:08,560 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:03:08,597 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-09 15:03:08,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 120 transitions, 247 flow [2023-12-09 15:03:08,670 INFO L124 PetriNetUnfolderBase]: 17/162 cut-off events. [2023-12-09 15:03:08,670 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 15:03:08,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 162 events. 17/162 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/140 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2023-12-09 15:03:08,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 120 transitions, 247 flow [2023-12-09 15:03:08,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 115 transitions, 234 flow [2023-12-09 15:03:08,685 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:08,690 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;@114a7018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:08,690 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:08,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:08,703 INFO L124 PetriNetUnfolderBase]: 5/81 cut-off events. [2023-12-09 15:03:08,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:08,703 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:08,704 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:08,704 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:08,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1424208841, now seen corresponding path program 1 times [2023-12-09 15:03:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302589877] [2023-12-09 15:03:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:08,954 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:03:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302589877] [2023-12-09 15:03:08,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302589877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:08,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:08,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221099637] [2023-12-09 15:03:08,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:08,965 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:08,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:08,995 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 120 [2023-12-09 15:03:08,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:03:08,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:08,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 120 [2023-12-09 15:03:08,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:09,116 INFO L124 PetriNetUnfolderBase]: 66/435 cut-off events. [2023-12-09 15:03:09,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:09,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 435 events. 66/435 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2130 event pairs, 6 based on Foata normal form. 69/470 useless extension candidates. Maximal degree in co-relation 541. Up to 132 conditions per place. [2023-12-09 15:03:09,120 INFO L140 encePairwiseOnDemand]: 106/120 looper letters, 23 selfloop transitions, 2 changer transitions 16/111 dead transitions. [2023-12-09 15:03:09,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 111 transitions, 282 flow [2023-12-09 15:03:09,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-12-09 15:03:09,135 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2023-12-09 15:03:09,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-12-09 15:03:09,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-12-09 15:03:09,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:09,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-12-09 15:03:09,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:03:09,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:09,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:09,149 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, 1 predicate places. [2023-12-09 15:03:09,149 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 111 transitions, 282 flow [2023-12-09 15:03:09,149 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:03:09,149 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:09,150 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] [2023-12-09 15:03:09,150 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:03:09,150 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:09,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1086596451, now seen corresponding path program 1 times [2023-12-09 15:03:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:09,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868709377] [2023-12-09 15:03:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:09,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:03:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:09,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:03:09,260 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:03:09,262 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:03:09,263 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:03:09,263 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:03:09,264 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 15:03:09,267 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:03:09,267 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 15:03:09,317 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:03:09,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 157 transitions, 330 flow [2023-12-09 15:03:09,342 INFO L124 PetriNetUnfolderBase]: 31/267 cut-off events. [2023-12-09 15:03:09,342 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-09 15:03:09,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 267 events. 31/267 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 862 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 164. Up to 8 conditions per place. [2023-12-09 15:03:09,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 157 transitions, 330 flow [2023-12-09 15:03:09,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 157 transitions, 330 flow [2023-12-09 15:03:09,353 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:09,355 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;@114a7018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:09,355 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:09,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:09,362 INFO L124 PetriNetUnfolderBase]: 5/81 cut-off events. [2023-12-09 15:03:09,362 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:09,362 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:09,362 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] [2023-12-09 15:03:09,364 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:09,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1659995316, now seen corresponding path program 1 times [2023-12-09 15:03:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:09,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445422477] [2023-12-09 15:03:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:09,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:09,475 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:03:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445422477] [2023-12-09 15:03:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445422477] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:09,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515145322] [2023-12-09 15:03:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:09,496 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:09,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:09,497 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 157 [2023-12-09 15:03:09,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 157 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:03:09,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:09,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 157 [2023-12-09 15:03:09,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:09,953 INFO L124 PetriNetUnfolderBase]: 1058/3906 cut-off events. [2023-12-09 15:03:09,953 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-12-09 15:03:09,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 3906 events. 1058/3906 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 35058 event pairs, 480 based on Foata normal form. 887/4485 useless extension candidates. Maximal degree in co-relation 724. Up to 1728 conditions per place. [2023-12-09 15:03:09,967 INFO L140 encePairwiseOnDemand]: 137/157 looper letters, 32 selfloop transitions, 2 changer transitions 22/149 dead transitions. [2023-12-09 15:03:09,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 149 transitions, 392 flow [2023-12-09 15:03:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-12-09 15:03:09,970 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8365180467091295 [2023-12-09 15:03:09,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-12-09 15:03:09,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-12-09 15:03:09,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:09,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-12-09 15:03:09,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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:03:09,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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:03:09,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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:03:09,981 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 1 predicate places. [2023-12-09 15:03:09,981 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 149 transitions, 392 flow [2023-12-09 15:03:09,982 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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:03:09,982 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:09,982 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] [2023-12-09 15:03:09,982 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:03:09,982 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:09,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1234999529, now seen corresponding path program 1 times [2023-12-09 15:03:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446894897] [2023-12-09 15:03:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:10,150 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:03:10,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:10,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446894897] [2023-12-09 15:03:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446894897] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:03:10,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47191995] [2023-12-09 15:03:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:10,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:03:10,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:10,153 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:03:10,177 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:03:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:10,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:03:10,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:03:10,322 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:03:10,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:03:10,369 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:03:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47191995] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:03:10,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:03:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:03:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015618776] [2023-12-09 15:03:10,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:03:10,371 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:03:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:03:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:03:10,373 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 157 [2023-12-09 15:03:10,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 149 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 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:03:10,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:10,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 157 [2023-12-09 15:03:10,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:10,602 INFO L124 PetriNetUnfolderBase]: 492/1266 cut-off events. [2023-12-09 15:03:10,602 INFO L125 PetriNetUnfolderBase]: For 332/632 co-relation queries the response was YES. [2023-12-09 15:03:10,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 1266 events. 492/1266 cut-off events. For 332/632 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8211 event pairs, 0 based on Foata normal form. 8/1250 useless extension candidates. Maximal degree in co-relation 383. Up to 754 conditions per place. [2023-12-09 15:03:10,609 INFO L140 encePairwiseOnDemand]: 152/157 looper letters, 75 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2023-12-09 15:03:10,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 162 transitions, 658 flow [2023-12-09 15:03:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:03:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:03:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1065 transitions. [2023-12-09 15:03:10,612 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7537154989384289 [2023-12-09 15:03:10,612 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1065 transitions. [2023-12-09 15:03:10,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1065 transitions. [2023-12-09 15:03:10,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:10,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1065 transitions. [2023-12-09 15:03:10,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.33333333333333) internal successors, (1065), 9 states have internal predecessors, (1065), 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:03:10,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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:03:10,617 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 157.0) internal successors, (1570), 10 states have internal predecessors, (1570), 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:03:10,619 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, -27 predicate places. [2023-12-09 15:03:10,619 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 162 transitions, 658 flow [2023-12-09 15:03:10,620 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 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:03:10,620 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:10,621 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] [2023-12-09 15:03:10,643 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:03:10,825 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:03:10,826 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:10,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1736432953, now seen corresponding path program 1 times [2023-12-09 15:03:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933122849] [2023-12-09 15:03:10,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:10,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:03:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:10,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:03:10,888 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:03:10,889 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:03:10,889 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:03:10,889 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:03:10,889 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:03:10,889 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:03:10,890 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 15:03:10,911 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:03:10,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 194 transitions, 415 flow [2023-12-09 15:03:10,946 INFO L124 PetriNetUnfolderBase]: 50/407 cut-off events. [2023-12-09 15:03:10,946 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-09 15:03:10,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 407 events. 50/407 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1437 event pairs, 1 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 275. Up to 16 conditions per place. [2023-12-09 15:03:10,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 194 transitions, 415 flow [2023-12-09 15:03:10,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 194 transitions, 415 flow [2023-12-09 15:03:10,952 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:10,952 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;@114a7018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:10,953 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:10,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:10,957 INFO L124 PetriNetUnfolderBase]: 5/81 cut-off events. [2023-12-09 15:03:10,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:10,957 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:10,957 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] [2023-12-09 15:03:10,958 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:10,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash -957722570, now seen corresponding path program 1 times [2023-12-09 15:03:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067102876] [2023-12-09 15:03:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:10,987 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:03:10,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:10,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067102876] [2023-12-09 15:03:10,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067102876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:10,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:10,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:10,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947662649] [2023-12-09 15:03:10,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:10,988 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:10,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:10,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:10,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:10,989 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 194 [2023-12-09 15:03:10,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 194 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:10,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:10,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 194 [2023-12-09 15:03:10,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:14,889 INFO L124 PetriNetUnfolderBase]: 11851/34531 cut-off events. [2023-12-09 15:03:14,889 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2023-12-09 15:03:15,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51816 conditions, 34531 events. 11851/34531 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 419890 event pairs, 7555 based on Foata normal form. 9203/42678 useless extension candidates. Maximal degree in co-relation 5993. Up to 16847 conditions per place. [2023-12-09 15:03:15,228 INFO L140 encePairwiseOnDemand]: 168/194 looper letters, 39 selfloop transitions, 2 changer transitions 23/180 dead transitions. [2023-12-09 15:03:15,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 180 transitions, 481 flow [2023-12-09 15:03:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-12-09 15:03:15,230 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8195876288659794 [2023-12-09 15:03:15,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-12-09 15:03:15,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-12-09 15:03:15,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:15,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-12-09 15:03:15,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-09 15:03:15,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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:03:15,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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:03:15,233 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places. [2023-12-09 15:03:15,233 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 180 transitions, 481 flow [2023-12-09 15:03:15,234 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:15,234 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:15,234 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] [2023-12-09 15:03:15,234 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:03:15,234 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:15,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash -85656682, now seen corresponding path program 1 times [2023-12-09 15:03:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:15,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272841364] [2023-12-09 15:03:15,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:15,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03: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:03:15,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:15,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272841364] [2023-12-09 15:03:15,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272841364] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:03:15,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633977396] [2023-12-09 15:03:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:15,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:03:15,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:15,297 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:03:15,348 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:03:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:15,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:03:15,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:03:15,452 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:03:15,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:03:15,486 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:03:15,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633977396] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:03:15,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:03:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:03:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193405654] [2023-12-09 15:03:15,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:03:15,492 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:03:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:15,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:03:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:03:15,496 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 194 [2023-12-09 15:03:15,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 180 transitions, 481 flow. Second operand has 10 states, 10 states have (on average 134.6) internal successors, (1346), 10 states have internal predecessors, (1346), 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:03:15,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:15,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 194 [2023-12-09 15:03:15,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:18,781 INFO L124 PetriNetUnfolderBase]: 12227/32033 cut-off events. [2023-12-09 15:03:18,781 INFO L125 PetriNetUnfolderBase]: For 6838/12810 co-relation queries the response was YES. [2023-12-09 15:03:18,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66779 conditions, 32033 events. 12227/32033 cut-off events. For 6838/12810 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 359384 event pairs, 905 based on Foata normal form. 7/30011 useless extension candidates. Maximal degree in co-relation 7414. Up to 16943 conditions per place. [2023-12-09 15:03:19,017 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 106 selfloop transitions, 9 changer transitions 23/253 dead transitions. [2023-12-09 15:03:19,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 253 transitions, 1011 flow [2023-12-09 15:03:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:03:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:03:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1311 transitions. [2023-12-09 15:03:19,021 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7508591065292096 [2023-12-09 15:03:19,021 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1311 transitions. [2023-12-09 15:03:19,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1311 transitions. [2023-12-09 15:03:19,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:19,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1311 transitions. [2023-12-09 15:03:19,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.66666666666666) internal successors, (1311), 9 states have internal predecessors, (1311), 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:03:19,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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:03:19,029 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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:03:19,031 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 9 predicate places. [2023-12-09 15:03:19,031 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 253 transitions, 1011 flow [2023-12-09 15:03:19,032 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 134.6) internal successors, (1346), 10 states have internal predecessors, (1346), 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:03:19,032 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:19,032 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] [2023-12-09 15:03:19,049 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:03:19,238 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:03:19,239 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:19,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 600024018, now seen corresponding path program 1 times [2023-12-09 15:03:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:19,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913490736] [2023-12-09 15:03:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:19,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:03:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:19,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:03:19,274 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:03:19,275 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:03:19,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:03:19,275 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:03:19,275 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:03:19,276 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:03:19,276 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 15:03:19,299 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-09 15:03:19,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 231 transitions, 502 flow [2023-12-09 15:03:19,350 INFO L124 PetriNetUnfolderBase]: 81/619 cut-off events. [2023-12-09 15:03:19,350 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-09 15:03:19,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 619 events. 81/619 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2503 event pairs, 6 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 427. Up to 32 conditions per place. [2023-12-09 15:03:19,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 231 transitions, 502 flow [2023-12-09 15:03:19,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 231 transitions, 502 flow [2023-12-09 15:03:19,358 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:19,358 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;@114a7018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:19,358 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:19,361 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:19,361 INFO L124 PetriNetUnfolderBase]: 5/82 cut-off events. [2023-12-09 15:03:19,362 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:19,362 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:19,362 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] [2023-12-09 15:03:19,362 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:19,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash -687427907, now seen corresponding path program 1 times [2023-12-09 15:03:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915965607] [2023-12-09 15:03:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:19,390 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:03:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915965607] [2023-12-09 15:03:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915965607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:19,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:19,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98982100] [2023-12-09 15:03:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:19,390 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:19,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 231 [2023-12-09 15:03:19,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 231 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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:03:19,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:19,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 231 [2023-12-09 15:03:19,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:56,798 INFO L124 PetriNetUnfolderBase]: 116073/285061 cut-off events. [2023-12-09 15:03:56,798 INFO L125 PetriNetUnfolderBase]: For 11989/11989 co-relation queries the response was YES. [2023-12-09 15:03:58,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441745 conditions, 285061 events. 116073/285061 cut-off events. For 11989/11989 co-relation queries the response was YES. Maximal size of possible extension queue 6082. Compared 4108520 event pairs, 84882 based on Foata normal form. 87197/364970 useless extension candidates. Maximal degree in co-relation 52659. Up to 152541 conditions per place. [2023-12-09 15:03:59,574 INFO L140 encePairwiseOnDemand]: 199/231 looper letters, 46 selfloop transitions, 2 changer transitions 24/211 dead transitions. [2023-12-09 15:03:59,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 211 transitions, 572 flow [2023-12-09 15:03:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2023-12-09 15:03:59,592 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8080808080808081 [2023-12-09 15:03:59,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2023-12-09 15:03:59,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2023-12-09 15:03:59,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:59,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2023-12-09 15:03:59,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:03:59,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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:03:59,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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:03:59,596 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, 1 predicate places. [2023-12-09 15:03:59,596 INFO L500 AbstractCegarLoop]: Abstraction has has 208 places, 211 transitions, 572 flow [2023-12-09 15:03:59,596 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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:03:59,596 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:59,596 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] [2023-12-09 15:03:59,596 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:03:59,596 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:59,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1031235578, now seen corresponding path program 1 times [2023-12-09 15:03:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855030031] [2023-12-09 15:03:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:59,706 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:03:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855030031] [2023-12-09 15:03:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855030031] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:03:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130421198] [2023-12-09 15:03:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:59,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:03:59,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:59,708 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:03:59,710 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:03:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:59,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:03:59,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:03:59,821 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:03:59,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:03:59,845 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:03:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130421198] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:03:59,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:03:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:03:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808919183] [2023-12-09 15:03:59,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:03:59,846 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:03:59,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:59,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:03:59,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:03:59,848 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 231 [2023-12-09 15:03:59,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 211 transitions, 572 flow. Second operand has 10 states, 10 states have (on average 157.6) internal successors, (1576), 10 states have internal predecessors, (1576), 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:03:59,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:59,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 231 [2023-12-09 15:03:59,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand