/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/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:33:21,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:33:21,752 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:33:21,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:33:21,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:33:21,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:33:21,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:33:21,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:33:21,769 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:33:21,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:33:21,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:33:21,772 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:33:21,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:33:21,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:33:21,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:33:21,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:33:21,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:33:21,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:33:21,774 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:33:21,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:33:21,774 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:33:21,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:33:21,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:33:21,775 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:33:21,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:33:21,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:33:21,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:33:21,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:33:21,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:33:21,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:33:21,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:33:21,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:33:21,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:33:21,778 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:33:21,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:33:22,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:33:22,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:33:22,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:33:22,022 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:33:22,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-12-09 15:33:23,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:33:23,282 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:33:23,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-12-09 15:33:23,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b85ee746/1d5e32c7c3b545f7bef00b3413f40bff/FLAGac782e8f1 [2023-12-09 15:33:23,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b85ee746/1d5e32c7c3b545f7bef00b3413f40bff [2023-12-09 15:33:23,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:33:23,304 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:33:23,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:33:23,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:33:23,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:33:23,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e380a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23, skipping insertion in model container [2023-12-09 15:33:23,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,343 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:33:23,452 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3146,3159] [2023-12-09 15:33:23,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:33:23,464 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:33:23,478 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3146,3159] [2023-12-09 15:33:23,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:33:23,485 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:33:23,486 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:33:23,490 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:33:23,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23 WrapperNode [2023-12-09 15:33:23,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:33:23,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:33:23,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:33:23,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:33:23,496 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:33:23" (1/1) ... [2023-12-09 15:33:23,501 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:33:23" (1/1) ... [2023-12-09 15:33:23,517 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 166 [2023-12-09 15:33:23,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:33:23,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:33:23,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:33:23,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:33:23,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:33:23,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:33:23,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:33:23,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:33:23,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (1/1) ... [2023-12-09 15:33:23,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:33:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:33:23,560 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:33:23,588 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:33:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:33:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:33:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:33:23,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:33:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:33:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:33:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:33:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:33:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:33:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:33:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:33:23,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:33:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:33:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:33:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:33:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:33:23,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:33:23,617 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:33:23,687 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:33:23,688 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:33:23,923 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:33:23,991 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:33:23,991 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:33:23,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:33:23 BoogieIcfgContainer [2023-12-09 15:33:23,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:33:23,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:33:23,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:33:23,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:33:23,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:33:23" (1/3) ... [2023-12-09 15:33:23,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eca04d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:33:23, skipping insertion in model container [2023-12-09 15:33:23,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:33:23" (2/3) ... [2023-12-09 15:33:23,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eca04d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:33:23, skipping insertion in model container [2023-12-09 15:33:23,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:33:23" (3/3) ... [2023-12-09 15:33:23,997 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-12-09 15:33:24,008 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:33:24,008 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:33:24,009 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:33:24,084 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:33:24,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 145 transitions, 311 flow [2023-12-09 15:33:24,171 INFO L124 PetriNetUnfolderBase]: 10/142 cut-off events. [2023-12-09 15:33:24,171 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:33:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 10/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2023-12-09 15:33:24,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 145 transitions, 311 flow [2023-12-09 15:33:24,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 131 transitions, 280 flow [2023-12-09 15:33:24,185 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:33:24,190 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;@697ee68a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:33:24,190 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:33:24,212 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:33:24,212 INFO L124 PetriNetUnfolderBase]: 10/130 cut-off events. [2023-12-09 15:33:24,212 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:33:24,212 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:24,213 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:24,213 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:33:24,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash 49941176, now seen corresponding path program 1 times [2023-12-09 15:33:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736761358] [2023-12-09 15:33:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:24,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:24,730 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:33:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736761358] [2023-12-09 15:33:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736761358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:33:24,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:33:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:33:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831561709] [2023-12-09 15:33:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:33:24,740 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:33:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:33:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:33:24,767 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2023-12-09 15:33:24,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 131 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:33:24,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:24,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2023-12-09 15:33:24,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:24,955 INFO L124 PetriNetUnfolderBase]: 98/374 cut-off events. [2023-12-09 15:33:24,956 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-12-09 15:33:24,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 374 events. 98/374 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1455 event pairs, 20 based on Foata normal form. 32/358 useless extension candidates. Maximal degree in co-relation 462. Up to 64 conditions per place. [2023-12-09 15:33:24,963 INFO L140 encePairwiseOnDemand]: 134/145 looper letters, 35 selfloop transitions, 5 changer transitions 2/147 dead transitions. [2023-12-09 15:33:24,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 398 flow [2023-12-09 15:33:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:33:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:33:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-12-09 15:33:24,979 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9048275862068965 [2023-12-09 15:33:24,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-12-09 15:33:24,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-12-09 15:33:24,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:24,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-12-09 15:33:24,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 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:33:24,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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:33:24,996 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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:33:24,999 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 4 predicate places. [2023-12-09 15:33:24,999 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 147 transitions, 398 flow [2023-12-09 15:33:25,000 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:33:25,000 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:25,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:25,001 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:33:25,001 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:33:25,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash -797338234, now seen corresponding path program 2 times [2023-12-09 15:33:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:25,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684030218] [2023-12-09 15:33:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:25,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:25,185 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:33:25,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:25,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684030218] [2023-12-09 15:33:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684030218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:33:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:33:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:33:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876924414] [2023-12-09 15:33:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:33:25,187 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:33:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:25,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:33:25,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:33:25,190 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 145 [2023-12-09 15:33:25,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 147 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:33:25,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:25,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 145 [2023-12-09 15:33:25,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:25,300 INFO L124 PetriNetUnfolderBase]: 158/570 cut-off events. [2023-12-09 15:33:25,301 INFO L125 PetriNetUnfolderBase]: For 219/308 co-relation queries the response was YES. [2023-12-09 15:33:25,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 570 events. 158/570 cut-off events. For 219/308 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2876 event pairs, 24 based on Foata normal form. 16/511 useless extension candidates. Maximal degree in co-relation 927. Up to 102 conditions per place. [2023-12-09 15:33:25,306 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 50 selfloop transitions, 9 changer transitions 2/168 dead transitions. [2023-12-09 15:33:25,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 168 transitions, 605 flow [2023-12-09 15:33:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:33:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:33:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-12-09 15:33:25,307 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8841379310344828 [2023-12-09 15:33:25,307 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-12-09 15:33:25,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-12-09 15:33:25,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:25,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-12-09 15:33:25,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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:33:25,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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:33:25,311 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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:33:25,311 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 8 predicate places. [2023-12-09 15:33:25,312 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 168 transitions, 605 flow [2023-12-09 15:33:25,312 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:33:25,312 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:25,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:25,313 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:33:25,313 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:33:25,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1653776474, now seen corresponding path program 3 times [2023-12-09 15:33:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60520364] [2023-12-09 15:33:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:25,567 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:33:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:25,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60520364] [2023-12-09 15:33:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60520364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:33:25,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:33:25,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:33:25,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132148589] [2023-12-09 15:33:25,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:33:25,570 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:33:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:25,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:33:25,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:33:25,573 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 145 [2023-12-09 15:33:25,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 168 transitions, 605 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 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:33:25,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:25,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 145 [2023-12-09 15:33:25,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:25,753 INFO L124 PetriNetUnfolderBase]: 269/839 cut-off events. [2023-12-09 15:33:25,754 INFO L125 PetriNetUnfolderBase]: For 751/1405 co-relation queries the response was YES. [2023-12-09 15:33:25,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 839 events. 269/839 cut-off events. For 751/1405 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5078 event pairs, 27 based on Foata normal form. 46/784 useless extension candidates. Maximal degree in co-relation 1977. Up to 187 conditions per place. [2023-12-09 15:33:25,758 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 56 selfloop transitions, 10 changer transitions 56/228 dead transitions. [2023-12-09 15:33:25,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 228 transitions, 1206 flow [2023-12-09 15:33:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:33:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:33:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-12-09 15:33:25,760 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.870935960591133 [2023-12-09 15:33:25,760 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-12-09 15:33:25,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-12-09 15:33:25,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:25,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-12-09 15:33:25,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 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:33:25,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 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:33:25,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 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:33:25,765 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 14 predicate places. [2023-12-09 15:33:25,766 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 228 transitions, 1206 flow [2023-12-09 15:33:25,766 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 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:33:25,766 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:25,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:25,766 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:33:25,766 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:33:25,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash -817831758, now seen corresponding path program 1 times [2023-12-09 15:33:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295623009] [2023-12-09 15:33:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295623009] [2023-12-09 15:33:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295623009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:33:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:33:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:33:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77169150] [2023-12-09 15:33:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:33:25,835 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:33:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:25,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:33:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:33:25,837 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 145 [2023-12-09 15:33:25,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 228 transitions, 1206 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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:33:25,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:25,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 145 [2023-12-09 15:33:25,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:25,989 INFO L124 PetriNetUnfolderBase]: 322/1024 cut-off events. [2023-12-09 15:33:25,990 INFO L125 PetriNetUnfolderBase]: For 2051/2544 co-relation queries the response was YES. [2023-12-09 15:33:25,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1024 events. 322/1024 cut-off events. For 2051/2544 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5980 event pairs, 38 based on Foata normal form. 29/906 useless extension candidates. Maximal degree in co-relation 2684. Up to 266 conditions per place. [2023-12-09 15:33:25,994 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 39 selfloop transitions, 5 changer transitions 66/236 dead transitions. [2023-12-09 15:33:25,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 236 transitions, 1428 flow [2023-12-09 15:33:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:33:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:33:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-12-09 15:33:25,996 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8988505747126436 [2023-12-09 15:33:25,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-12-09 15:33:25,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-12-09 15:33:25,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:25,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-12-09 15:33:25,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:33:25,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:33:25,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:33:26,001 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 16 predicate places. [2023-12-09 15:33:26,001 INFO L500 AbstractCegarLoop]: Abstraction has has 147 places, 236 transitions, 1428 flow [2023-12-09 15:33:26,001 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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:33:26,001 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:26,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:26,002 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:33:26,002 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:33:26,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1962031212, now seen corresponding path program 1 times [2023-12-09 15:33:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:26,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298233359] [2023-12-09 15:33:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298233359] [2023-12-09 15:33:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298233359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:33:26,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:33:26,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:33:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225816362] [2023-12-09 15:33:26,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:33:26,125 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:33:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:26,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:33:26,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:33:26,126 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 145 [2023-12-09 15:33:26,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 236 transitions, 1428 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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:33:26,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:26,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 145 [2023-12-09 15:33:26,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:26,373 INFO L124 PetriNetUnfolderBase]: 458/1542 cut-off events. [2023-12-09 15:33:26,374 INFO L125 PetriNetUnfolderBase]: For 5019/5791 co-relation queries the response was YES. [2023-12-09 15:33:26,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4569 conditions, 1542 events. 458/1542 cut-off events. For 5019/5791 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10139 event pairs, 67 based on Foata normal form. 32/1335 useless extension candidates. Maximal degree in co-relation 3017. Up to 361 conditions per place. [2023-12-09 15:33:26,381 INFO L140 encePairwiseOnDemand]: 134/145 looper letters, 53 selfloop transitions, 8 changer transitions 113/287 dead transitions. [2023-12-09 15:33:26,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 287 transitions, 2181 flow [2023-12-09 15:33:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:33:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:33:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1041 transitions. [2023-12-09 15:33:26,384 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7977011494252874 [2023-12-09 15:33:26,384 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1041 transitions. [2023-12-09 15:33:26,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1041 transitions. [2023-12-09 15:33:26,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:26,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1041 transitions. [2023-12-09 15:33:26,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.66666666666667) internal successors, (1041), 9 states have internal predecessors, (1041), 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:33:26,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 145.0) internal successors, (1450), 10 states have internal predecessors, (1450), 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:33:26,390 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 145.0) internal successors, (1450), 10 states have internal predecessors, (1450), 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:33:26,392 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 24 predicate places. [2023-12-09 15:33:26,392 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 287 transitions, 2181 flow [2023-12-09 15:33:26,392 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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:33:26,392 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:26,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:26,393 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:33:26,393 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:33:26,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash -250088550, now seen corresponding path program 1 times [2023-12-09 15:33:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922711447] [2023-12-09 15:33:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922711447] [2023-12-09 15:33:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922711447] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:33:27,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331877553] [2023-12-09 15:33:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:27,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:33:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:33:27,267 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:33:27,300 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:33:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:27,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-09 15:33:27,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:33:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:28,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:33:28,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:33:28,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2023-12-09 15:33:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331877553] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:33:29,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:33:29,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 15] total 47 [2023-12-09 15:33:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291808267] [2023-12-09 15:33:29,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:33:29,357 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-09 15:33:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:29,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-09 15:33:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1790, Unknown=0, NotChecked=0, Total=2162 [2023-12-09 15:33:29,362 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 145 [2023-12-09 15:33:29,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 287 transitions, 2181 flow. Second operand has 47 states, 47 states have (on average 75.34042553191489) internal successors, (3541), 47 states have internal predecessors, (3541), 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:33:29,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:29,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 145 [2023-12-09 15:33:29,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:33:33,484 INFO L124 PetriNetUnfolderBase]: 6521/13319 cut-off events. [2023-12-09 15:33:33,484 INFO L125 PetriNetUnfolderBase]: For 26424/26474 co-relation queries the response was YES. [2023-12-09 15:33:33,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45882 conditions, 13319 events. 6521/13319 cut-off events. For 26424/26474 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 112818 event pairs, 358 based on Foata normal form. 118/12485 useless extension candidates. Maximal degree in co-relation 21167. Up to 2527 conditions per place. [2023-12-09 15:33:33,555 INFO L140 encePairwiseOnDemand]: 108/145 looper letters, 339 selfloop transitions, 166 changer transitions 534/1097 dead transitions. [2023-12-09 15:33:33,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1097 transitions, 10256 flow [2023-12-09 15:33:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-12-09 15:33:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2023-12-09 15:33:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 6439 transitions. [2023-12-09 15:33:33,569 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5482332907620264 [2023-12-09 15:33:33,569 INFO L72 ComplementDD]: Start complementDD. Operand 81 states and 6439 transitions. [2023-12-09 15:33:33,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 6439 transitions. [2023-12-09 15:33:33,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:33:33,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 6439 transitions. [2023-12-09 15:33:33,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 82 states, 81 states have (on average 79.49382716049382) internal successors, (6439), 81 states have internal predecessors, (6439), 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:33:33,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 82 states, 82 states have (on average 145.0) internal successors, (11890), 82 states have internal predecessors, (11890), 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:33:33,601 INFO L81 ComplementDD]: Finished complementDD. Result has 82 states, 82 states have (on average 145.0) internal successors, (11890), 82 states have internal predecessors, (11890), 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:33:33,603 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 104 predicate places. [2023-12-09 15:33:33,603 INFO L500 AbstractCegarLoop]: Abstraction has has 235 places, 1097 transitions, 10256 flow [2023-12-09 15:33:33,605 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 75.34042553191489) internal successors, (3541), 47 states have internal predecessors, (3541), 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:33:33,605 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:33:33,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:33,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:33:33,811 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-09 15:33:33,812 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:33:33,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:33:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 742240398, now seen corresponding path program 2 times [2023-12-09 15:33:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:33:33,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824496973] [2023-12-09 15:33:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:33:33,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:33:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:33:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:33:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824496973] [2023-12-09 15:33:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824496973] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:33:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003437516] [2023-12-09 15:33:35,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:33:35,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:33:35,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:33:35,044 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:33:35,046 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:33:35,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:33:35,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:33:35,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-09 15:33:35,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:33:35,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-09 15:33:36,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:33:36,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:33:36,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:33:36,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-09 15:33:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:36,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:33:38,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:33:38,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-12-09 15:33:38,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:33:38,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1504 treesize of output 1432 [2023-12-09 15:33:38,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:33:38,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2023-12-09 15:33:38,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:33:38,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 110 [2023-12-09 15:33:38,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-12-09 15:33:38,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:33:38,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-12-09 15:33:38,673 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:33:38,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:33:38,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 324 treesize of output 296 [2023-12-09 15:33:38,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:33:38,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2023-12-09 15:33:38,701 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:33:38,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 75 [2023-12-09 15:33:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:33:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003437516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:33:39,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:33:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26, 25] total 65 [2023-12-09 15:33:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116935415] [2023-12-09 15:33:39,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:33:39,497 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-12-09 15:33:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:33:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-12-09 15:33:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=3738, Unknown=20, NotChecked=0, Total=4160 [2023-12-09 15:33:39,501 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 145 [2023-12-09 15:33:39,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 1097 transitions, 10256 flow. Second operand has 65 states, 65 states have (on average 61.8) internal successors, (4017), 65 states have internal predecessors, (4017), 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:33:39,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:33:39,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 145 [2023-12-09 15:33:39,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:34:00,688 INFO L124 PetriNetUnfolderBase]: 19859/39623 cut-off events. [2023-12-09 15:34:00,688 INFO L125 PetriNetUnfolderBase]: For 86024/88098 co-relation queries the response was YES. [2023-12-09 15:34:00,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172998 conditions, 39623 events. 19859/39623 cut-off events. For 86024/88098 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 397194 event pairs, 738 based on Foata normal form. 396/37302 useless extension candidates. Maximal degree in co-relation 91998. Up to 8519 conditions per place. [2023-12-09 15:34:00,944 INFO L140 encePairwiseOnDemand]: 102/145 looper letters, 869 selfloop transitions, 399 changer transitions 2766/4085 dead transitions. [2023-12-09 15:34:00,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 4085 transitions, 46684 flow [2023-12-09 15:34:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2023-12-09 15:34:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2023-12-09 15:34:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 8723 transitions. [2023-12-09 15:34:00,963 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4592261121347723 [2023-12-09 15:34:00,964 INFO L72 ComplementDD]: Start complementDD. Operand 131 states and 8723 transitions. [2023-12-09 15:34:00,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 8723 transitions. [2023-12-09 15:34:00,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:34:00,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 131 states and 8723 transitions. [2023-12-09 15:34:00,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 132 states, 131 states have (on average 66.58778625954199) internal successors, (8723), 131 states have internal predecessors, (8723), 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:34:01,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 132 states, 132 states have (on average 145.0) internal successors, (19140), 132 states have internal predecessors, (19140), 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:34:01,020 INFO L81 ComplementDD]: Finished complementDD. Result has 132 states, 132 states have (on average 145.0) internal successors, (19140), 132 states have internal predecessors, (19140), 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:34:01,021 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 234 predicate places. [2023-12-09 15:34:01,021 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 4085 transitions, 46684 flow [2023-12-09 15:34:01,023 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 61.8) internal successors, (4017), 65 states have internal predecessors, (4017), 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:34:01,023 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:34:01,023 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:34:01,230 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:34:01,230 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:34:01,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:34:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash -310570286, now seen corresponding path program 3 times [2023-12-09 15:34:01,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:34:01,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118619932] [2023-12-09 15:34:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:34:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:34:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:34:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:34:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:34:01,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118619932] [2023-12-09 15:34:01,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118619932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:34:01,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:34:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:34:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418873559] [2023-12-09 15:34:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:34:01,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:34:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:34:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:34:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:34:01,327 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 145 [2023-12-09 15:34:01,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 4085 transitions, 46684 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:34:01,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:34:01,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 145 [2023-12-09 15:34:01,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:34:13,040 INFO L124 PetriNetUnfolderBase]: 25022/50744 cut-off events. [2023-12-09 15:34:13,040 INFO L125 PetriNetUnfolderBase]: For 155728/157259 co-relation queries the response was YES. [2023-12-09 15:34:13,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229419 conditions, 50744 events. 25022/50744 cut-off events. For 155728/157259 co-relation queries the response was YES. Maximal size of possible extension queue 1591. Compared 527063 event pairs, 1022 based on Foata normal form. 552/47726 useless extension candidates. Maximal degree in co-relation 108008. Up to 10530 conditions per place. [2023-12-09 15:34:13,503 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 395 selfloop transitions, 133 changer transitions 2840/4145 dead transitions. [2023-12-09 15:34:13,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 4145 transitions, 53335 flow [2023-12-09 15:34:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:34:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:34:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2023-12-09 15:34:13,505 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.906896551724138 [2023-12-09 15:34:13,505 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2023-12-09 15:34:13,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2023-12-09 15:34:13,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:34:13,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2023-12-09 15:34:13,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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:34:13,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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:34:13,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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:34:13,508 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 223 predicate places. [2023-12-09 15:34:13,509 INFO L500 AbstractCegarLoop]: Abstraction has has 354 places, 4145 transitions, 53335 flow [2023-12-09 15:34:13,509 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:34:13,509 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:34:13,509 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:13,509 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:34:13,509 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:34:13,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:34:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2100366778, now seen corresponding path program 1 times [2023-12-09 15:34:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:34:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588234455] [2023-12-09 15:34:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:34:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:34:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:34:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:34:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:34:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588234455] [2023-12-09 15:34:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588234455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:34:13,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:34:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:34:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414193212] [2023-12-09 15:34:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:34:13,596 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:34:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:34:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:34:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:34:13,597 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2023-12-09 15:34:13,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 4145 transitions, 53335 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:34:13,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:34:13,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2023-12-09 15:34:13,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:34:27,243 INFO L124 PetriNetUnfolderBase]: 24293/49351 cut-off events. [2023-12-09 15:34:27,244 INFO L125 PetriNetUnfolderBase]: For 169431/171609 co-relation queries the response was YES. [2023-12-09 15:34:27,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237109 conditions, 49351 events. 24293/49351 cut-off events. For 169431/171609 co-relation queries the response was YES. Maximal size of possible extension queue 1539. Compared 509207 event pairs, 1014 based on Foata normal form. 35/45955 useless extension candidates. Maximal degree in co-relation 118551. Up to 13980 conditions per place. [2023-12-09 15:34:27,518 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 592 selfloop transitions, 19 changer transitions 2812/4101 dead transitions. [2023-12-09 15:34:27,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 4101 transitions, 56734 flow [2023-12-09 15:34:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:34:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:34:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-12-09 15:34:27,519 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2023-12-09 15:34:27,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-12-09 15:34:27,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-12-09 15:34:27,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:34:27,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-12-09 15:34:27,520 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:34:27,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:34:27,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:34:27,521 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 223 predicate places. [2023-12-09 15:34:27,521 INFO L500 AbstractCegarLoop]: Abstraction has has 354 places, 4101 transitions, 56734 flow [2023-12-09 15:34:27,521 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:34:27,521 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:34:27,521 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:27,521 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:34:27,521 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:34:27,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:34:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1785530098, now seen corresponding path program 4 times [2023-12-09 15:34:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:34:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653133724] [2023-12-09 15:34:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:34:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:34:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:34:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-09 15:34:27,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:34:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653133724] [2023-12-09 15:34:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653133724] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:34:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459759325] [2023-12-09 15:34:27,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:34:27,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:34:27,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:34:27,670 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:34:27,684 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:34:27,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:34:27,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:34:27,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:34:27,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:34:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-09 15:34:27,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:34:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-09 15:34:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459759325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:34:28,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:34:28,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-12-09 15:34:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031830504] [2023-12-09 15:34:28,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:34:28,120 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-09 15:34:28,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:34:28,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-09 15:34:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:34:28,122 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 145 [2023-12-09 15:34:28,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 4101 transitions, 56734 flow. Second operand has 19 states, 19 states have (on average 110.05263157894737) internal successors, (2091), 19 states have internal predecessors, (2091), 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:34:28,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:34:28,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 145 [2023-12-09 15:34:28,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:34:40,980 INFO L124 PetriNetUnfolderBase]: 23528/48309 cut-off events. [2023-12-09 15:34:40,981 INFO L125 PetriNetUnfolderBase]: For 218251/220467 co-relation queries the response was YES. [2023-12-09 15:34:41,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239462 conditions, 48309 events. 23528/48309 cut-off events. For 218251/220467 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 497568 event pairs, 994 based on Foata normal form. 536/45422 useless extension candidates. Maximal degree in co-relation 132175. Up to 13341 conditions per place. [2023-12-09 15:34:41,259 INFO L140 encePairwiseOnDemand]: 131/145 looper letters, 435 selfloop transitions, 13 changer transitions 2986/4001 dead transitions. [2023-12-09 15:34:41,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 4001 transitions, 58548 flow [2023-12-09 15:34:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-09 15:34:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-12-09 15:34:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1992 transitions. [2023-12-09 15:34:41,261 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7632183908045977 [2023-12-09 15:34:41,261 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1992 transitions. [2023-12-09 15:34:41,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1992 transitions. [2023-12-09 15:34:41,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:34:41,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1992 transitions. [2023-12-09 15:34:41,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 110.66666666666667) internal successors, (1992), 18 states have internal predecessors, (1992), 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:34:41,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 145.0) internal successors, (2755), 19 states have internal predecessors, (2755), 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:34:41,265 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 145.0) internal successors, (2755), 19 states have internal predecessors, (2755), 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:34:41,266 INFO L308 CegarLoopForPetriNet]: 131 programPoint places, 240 predicate places. [2023-12-09 15:34:41,266 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 4001 transitions, 58548 flow [2023-12-09 15:34:41,266 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 110.05263157894737) internal successors, (2091), 19 states have internal predecessors, (2091), 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:34:41,267 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:34:41,267 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:41,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:34:41,471 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:34:41,471 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:34:41,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:34:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1443577934, now seen corresponding path program 1 times [2023-12-09 15:34:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:34:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699705745] [2023-12-09 15:34:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:34:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:34:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:34:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:34:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:34:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699705745] [2023-12-09 15:34:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699705745] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:34:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083183111] [2023-12-09 15:34:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:34:42,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:34:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:34:42,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:34:42,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:34:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:34:42,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-09 15:34:42,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:34:42,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:34:42,718 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:34:42,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-09 15:34:43,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-12-09 15:34:43,869 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:34:43,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-12-09 15:34:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:34:43,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:34:44,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:34:44,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 66 [2023-12-09 15:34:44,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2023-12-09 15:34:44,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-12-09 15:34:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:34:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083183111] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:34:46,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:34:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 69 [2023-12-09 15:34:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643544701] [2023-12-09 15:34:46,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:34:46,195 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-12-09 15:34:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:34:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-12-09 15:34:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=4304, Unknown=1, NotChecked=0, Total=4692 [2023-12-09 15:34:46,200 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 145 [2023-12-09 15:34:46,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 4001 transitions, 58548 flow. Second operand has 69 states, 69 states have (on average 59.333333333333336) internal successors, (4094), 69 states have internal predecessors, (4094), 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:34:46,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:34:46,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 145 [2023-12-09 15:34:46,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:35:01,722 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~front~0 0))) (and (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< 1 c_~front~0) (< 0 c_~back~0) (let ((.cse0 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_20| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_20|) 0))))) (and (or (= c_~back~0 c_~front~0) .cse0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 0)) (or (< c_~sum~0 1) .cse0) (or (< 0 (+ c_~sum~0 2)) .cse0))) .cse1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_242 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_242) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_242 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_242) c_~queue~0.base) .cse2)) 1)))) (< c_~n~0 (+ c_~front~0 1)) (< c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0) .cse1) (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1))) is different from false [2023-12-09 15:35:06,711 WARN L854 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_242 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_242) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_242 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_242) c_~queue~0.base) .cse0)) 1)))) (< c_~n~0 (+ c_~front~0 1)) (< c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0) (< c_~front~0 0))) is different from false