/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 22:47:36,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 22:47:36,495 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-11-29 22:47:36,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 22:47:36,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 22:47:36,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 22:47:36,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 22:47:36,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 22:47:36,512 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 22:47:36,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 22:47:36,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 22:47:36,513 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 22:47:36,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 22:47:36,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 22:47:36,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 22:47:36,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 22:47:36,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 22:47:36,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 22:47:36,514 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 22:47:36,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 22:47:36,515 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 22:47:36,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 22:47:36,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 22:47:36,516 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 22:47:36,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 22:47:36,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:47:36,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 22:47:36,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 22:47:36,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 22:47:36,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 22:47:36,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 22:47:36,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 22:47:36,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 22:47:36,518 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-11-29 22:47:36,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 22:47:36,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 22:47:36,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 22:47:36,708 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 22:47:36,708 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 22:47:36,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-29 22:47:37,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 22:47:37,910 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 22:47:37,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-29 22:47:37,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc8230e75/bcc94d374a45473e98b79c4a9a459019/FLAGf304fd89d [2023-11-29 22:47:37,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc8230e75/bcc94d374a45473e98b79c4a9a459019 [2023-11-29 22:47:37,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 22:47:37,928 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 22:47:37,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 22:47:37,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 22:47:37,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 22:47:37,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:47:37" (1/1) ... [2023-11-29 22:47:37,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1491e7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:37, skipping insertion in model container [2023-11-29 22:47:37,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:47:37" (1/1) ... [2023-11-29 22:47:37,949 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 22:47:38,051 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-more-sum-array-hom.wvr.c[2435,2448] [2023-11-29 22:47:38,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:47:38,064 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 22:47:38,077 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-more-sum-array-hom.wvr.c[2435,2448] [2023-11-29 22:47:38,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:47:38,090 INFO L206 MainTranslator]: Completed translation [2023-11-29 22:47:38,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38 WrapperNode [2023-11-29 22:47:38,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 22:47:38,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 22:47:38,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 22:47:38,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 22:47:38,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,115 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-29 22:47:38,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 22:47:38,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 22:47:38,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 22:47:38,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 22:47:38,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 22:47:38,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 22:47:38,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 22:47:38,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 22:47:38,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (1/1) ... [2023-11-29 22:47:38,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:47:38,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:38,155 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-11-29 22:47:38,158 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-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 22:47:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 22:47:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 22:47:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 22:47:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 22:47:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 22:47:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 22:47:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 22:47:38,176 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 22:47:38,264 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 22:47:38,265 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 22:47:38,452 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 22:47:38,466 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 22:47:38,466 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 22:47:38,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:47:38 BoogieIcfgContainer [2023-11-29 22:47:38,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 22:47:38,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 22:47:38,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 22:47:38,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 22:47:38,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:47:37" (1/3) ... [2023-11-29 22:47:38,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad874e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:47:38, skipping insertion in model container [2023-11-29 22:47:38,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:47:38" (2/3) ... [2023-11-29 22:47:38,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad874e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:47:38, skipping insertion in model container [2023-11-29 22:47:38,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:47:38" (3/3) ... [2023-11-29 22:47:38,487 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-11-29 22:47:38,498 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 22:47:38,498 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 22:47:38,498 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 22:47:38,560 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 22:47:38,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 166 transitions, 353 flow [2023-11-29 22:47:38,632 INFO L124 PetriNetUnfolderBase]: 12/163 cut-off events. [2023-11-29 22:47:38,632 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 22:47:38,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 163 events. 12/163 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 121. Up to 2 conditions per place. [2023-11-29 22:47:38,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 166 transitions, 353 flow [2023-11-29 22:47:38,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 152 transitions, 322 flow [2023-11-29 22:47:38,646 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 22:47:38,651 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;@19ce9cf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 22:47:38,651 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 22:47:38,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 22:47:38,711 INFO L124 PetriNetUnfolderBase]: 12/151 cut-off events. [2023-11-29 22:47:38,711 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 22:47:38,711 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:38,712 INFO L232 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] [2023-11-29 22:47:38,712 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-11-29 22:47:38,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1216935869, now seen corresponding path program 1 times [2023-11-29 22:47:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238271456] [2023-11-29 22:47:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:47:39,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238271456] [2023-11-29 22:47:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238271456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:47:39,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:47:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 22:47:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285109396] [2023-11-29 22:47:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:39,507 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 22:47:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:39,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 22:47:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 22:47:39,541 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 166 [2023-11-29 22:47:39,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 152 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 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-11-29 22:47:39,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:39,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 166 [2023-11-29 22:47:39,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:39,730 INFO L124 PetriNetUnfolderBase]: 54/437 cut-off events. [2023-11-29 22:47:39,730 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-29 22:47:39,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 437 events. 54/437 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1767 event pairs, 7 based on Foata normal form. 64/460 useless extension candidates. Maximal degree in co-relation 337. Up to 54 conditions per place. [2023-11-29 22:47:39,735 INFO L140 encePairwiseOnDemand]: 145/166 looper letters, 59 selfloop transitions, 9 changer transitions 11/183 dead transitions. [2023-11-29 22:47:39,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 183 transitions, 578 flow [2023-11-29 22:47:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 22:47:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 22:47:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1387 transitions. [2023-11-29 22:47:39,750 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7595837897042717 [2023-11-29 22:47:39,751 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1387 transitions. [2023-11-29 22:47:39,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1387 transitions. [2023-11-29 22:47:39,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:39,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1387 transitions. [2023-11-29 22:47:39,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.0909090909091) internal successors, (1387), 11 states have internal predecessors, (1387), 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-11-29 22:47:39,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 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-11-29 22:47:39,765 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 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-11-29 22:47:39,769 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 10 predicate places. [2023-11-29 22:47:39,769 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 183 transitions, 578 flow [2023-11-29 22:47:39,770 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 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-11-29 22:47:39,770 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:39,770 INFO L232 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] [2023-11-29 22:47:39,770 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 22:47:39,770 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-11-29 22:47:39,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash 238623233, now seen corresponding path program 1 times [2023-11-29 22:47:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196442972] [2023-11-29 22:47:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:47:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196442972] [2023-11-29 22:47:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196442972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:47:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:47:39,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 22:47:39,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768984645] [2023-11-29 22:47:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:39,975 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 22:47:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 22:47:39,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 22:47:39,978 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 166 [2023-11-29 22:47:39,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 183 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-29 22:47:39,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:39,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 166 [2023-11-29 22:47:39,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:40,273 INFO L124 PetriNetUnfolderBase]: 314/1196 cut-off events. [2023-11-29 22:47:40,274 INFO L125 PetriNetUnfolderBase]: For 611/624 co-relation queries the response was YES. [2023-11-29 22:47:40,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 1196 events. 314/1196 cut-off events. For 611/624 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7822 event pairs, 115 based on Foata normal form. 1/1034 useless extension candidates. Maximal degree in co-relation 1096. Up to 311 conditions per place. [2023-11-29 22:47:40,283 INFO L140 encePairwiseOnDemand]: 153/166 looper letters, 61 selfloop transitions, 14 changer transitions 12/215 dead transitions. [2023-11-29 22:47:40,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 215 transitions, 878 flow [2023-11-29 22:47:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 22:47:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 22:47:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1298 transitions. [2023-11-29 22:47:40,287 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7819277108433735 [2023-11-29 22:47:40,287 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1298 transitions. [2023-11-29 22:47:40,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1298 transitions. [2023-11-29 22:47:40,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:40,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1298 transitions. [2023-11-29 22:47:40,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 129.8) internal successors, (1298), 10 states have internal predecessors, (1298), 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-11-29 22:47:40,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 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-11-29 22:47:40,292 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 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-11-29 22:47:40,293 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 19 predicate places. [2023-11-29 22:47:40,293 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 215 transitions, 878 flow [2023-11-29 22:47:40,293 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-29 22:47:40,293 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:40,294 INFO L232 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] [2023-11-29 22:47:40,294 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 22:47:40,294 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-11-29 22:47:40,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1455536581, now seen corresponding path program 1 times [2023-11-29 22:47:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:40,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794987366] [2023-11-29 22:47:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:47:40,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:40,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794987366] [2023-11-29 22:47:40,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794987366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:47:40,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:47:40,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 22:47:40,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734040548] [2023-11-29 22:47:40,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:40,623 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 22:47:40,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 22:47:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 22:47:40,626 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 166 [2023-11-29 22:47:40,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 215 transitions, 878 flow. Second operand has 11 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 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-11-29 22:47:40,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:40,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 166 [2023-11-29 22:47:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:41,288 INFO L124 PetriNetUnfolderBase]: 1736/4179 cut-off events. [2023-11-29 22:47:41,288 INFO L125 PetriNetUnfolderBase]: For 3737/4038 co-relation queries the response was YES. [2023-11-29 22:47:41,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9479 conditions, 4179 events. 1736/4179 cut-off events. For 3737/4038 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 35500 event pairs, 1167 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 7615. Up to 1971 conditions per place. [2023-11-29 22:47:41,313 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 113 selfloop transitions, 18 changer transitions 18/241 dead transitions. [2023-11-29 22:47:41,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 241 transitions, 1265 flow [2023-11-29 22:47:41,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 22:47:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 22:47:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1515 transitions. [2023-11-29 22:47:41,317 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2023-11-29 22:47:41,317 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1515 transitions. [2023-11-29 22:47:41,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1515 transitions. [2023-11-29 22:47:41,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:41,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1515 transitions. [2023-11-29 22:47:41,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.0) internal successors, (1515), 15 states have internal predecessors, (1515), 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-11-29 22:47:41,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 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-11-29 22:47:41,324 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 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-11-29 22:47:41,325 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 33 predicate places. [2023-11-29 22:47:41,325 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 241 transitions, 1265 flow [2023-11-29 22:47:41,325 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 98.81818181818181) internal successors, (1087), 11 states have internal predecessors, (1087), 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-11-29 22:47:41,325 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:41,326 INFO L232 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] [2023-11-29 22:47:41,326 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 22:47:41,326 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-11-29 22:47:41,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1596356011, now seen corresponding path program 1 times [2023-11-29 22:47:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676270013] [2023-11-29 22:47:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:47:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:41,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676270013] [2023-11-29 22:47:41,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676270013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:47:41,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:47:41,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 22:47:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618766251] [2023-11-29 22:47:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:41,669 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 22:47:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 22:47:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 22:47:41,672 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 166 [2023-11-29 22:47:41,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 241 transitions, 1265 flow. Second operand has 11 states, 11 states have (on average 99.72727272727273) internal successors, (1097), 11 states have internal predecessors, (1097), 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-11-29 22:47:41,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:41,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 166 [2023-11-29 22:47:41,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:42,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] thread1EXIT-->L85-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem16#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][198], [thread2Thread1of1ForFork2InUse, 4#L85-2true, thread1Thread1of1ForFork1NotInUse, 235#true, 114#L56-5true, 185#true, thread3Thread1of1ForFork0InUse, 61#L64-5true, 167#true, 203#true]) [2023-11-29 22:47:42,445 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-29 22:47:42,445 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 22:47:42,445 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 22:47:42,445 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 22:47:42,455 INFO L124 PetriNetUnfolderBase]: 2206/4678 cut-off events. [2023-11-29 22:47:42,455 INFO L125 PetriNetUnfolderBase]: For 9277/10300 co-relation queries the response was YES. [2023-11-29 22:47:42,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13666 conditions, 4678 events. 2206/4678 cut-off events. For 9277/10300 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 38337 event pairs, 1378 based on Foata normal form. 2/3586 useless extension candidates. Maximal degree in co-relation 11949. Up to 2470 conditions per place. [2023-11-29 22:47:42,485 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 86 selfloop transitions, 10 changer transitions 58/245 dead transitions. [2023-11-29 22:47:42,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 245 transitions, 1614 flow [2023-11-29 22:47:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 22:47:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 22:47:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1433 transitions. [2023-11-29 22:47:42,488 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6166092943201377 [2023-11-29 22:47:42,488 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1433 transitions. [2023-11-29 22:47:42,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1433 transitions. [2023-11-29 22:47:42,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:42,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1433 transitions. [2023-11-29 22:47:42,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 102.35714285714286) internal successors, (1433), 14 states have internal predecessors, (1433), 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-11-29 22:47:42,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 166.0) internal successors, (2490), 15 states have internal predecessors, (2490), 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-11-29 22:47:42,494 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 166.0) internal successors, (2490), 15 states have internal predecessors, (2490), 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-11-29 22:47:42,494 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 46 predicate places. [2023-11-29 22:47:42,494 INFO L500 AbstractCegarLoop]: Abstraction has has 196 places, 245 transitions, 1614 flow [2023-11-29 22:47:42,495 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.72727272727273) internal successors, (1097), 11 states have internal predecessors, (1097), 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-11-29 22:47:42,495 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:42,495 INFO L232 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, 1, 1, 1, 1, 1, 1] [2023-11-29 22:47:42,495 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 22:47:42,495 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-11-29 22:47:42,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:42,496 INFO L85 PathProgramCache]: Analyzing trace with hash -363581912, now seen corresponding path program 1 times [2023-11-29 22:47:42,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:42,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441965564] [2023-11-29 22:47:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441965564] [2023-11-29 22:47:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441965564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558491606] [2023-11-29 22:47:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:42,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:42,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:42,642 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-11-29 22:47:42,682 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-11-29 22:47:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:42,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:47:42,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:47:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:42,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:47:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:43,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558491606] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:43,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:47:43,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-11-29 22:47:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723223390] [2023-11-29 22:47:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:43,066 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:47:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:47:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-29 22:47:43,068 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-11-29 22:47:43,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 245 transitions, 1614 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:43,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:43,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-11-29 22:47:43,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:43,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L48-6-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][187], [116#L49true, thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 156#L64-6true, 185#true, thread3Thread1of1ForFork0InUse, 44#L57true, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 167#true, 203#true]) [2023-11-29 22:47:43,742 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,742 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,742 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,742 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L48-6-->L48-7: Formula: (<= v_~N~0_1 v_thread1Thread1of1ForFork1_~i~0_5) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][188], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 156#L64-6true, 185#true, thread3Thread1of1ForFork0InUse, 44#L57true, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 144#L48-7true, 167#true, 203#true]) [2023-11-29 22:47:43,742 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,743 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,743 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,743 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L64-6-->L65: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_4) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][189], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 185#true, 15#L48-5true, 44#L57true, thread3Thread1of1ForFork0InUse, 67#L84-4true, 36#L65true, 167#true, 203#true, 1043#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0))]) [2023-11-29 22:47:43,743 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-29 22:47:43,743 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 22:47:43,744 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 22:47:43,745 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 22:47:43,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L64-6-->L64-7: Formula: (<= v_~N~0_3 v_thread3Thread1of1ForFork0_~i~2_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][190], [thread2Thread1of1ForFork2InUse, 27#L64-7true, thread1Thread1of1ForFork1InUse, 15#L48-5true, 185#true, 44#L57true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 167#true, 203#true]) [2023-11-29 22:47:43,749 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-29 22:47:43,749 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 22:47:43,749 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 22:47:43,749 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 22:47:43,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L48-6-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][187], [116#L49true, thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 185#true, 156#L64-6true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 19#L57-1true, 167#true, 203#true]) [2023-11-29 22:47:43,775 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 22:47:43,775 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 22:47:43,775 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 22:47:43,775 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L48-6-->L48-7: Formula: (<= v_~N~0_1 v_thread1Thread1of1ForFork1_~i~0_5) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][188], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, 185#true, 156#L64-6true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 19#L57-1true, 144#L48-7true, 167#true, 203#true]) [2023-11-29 22:47:43,776 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L64-6-->L65: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_4) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][189], [thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, 235#true, 185#true, 15#L48-5true, thread3Thread1of1ForFork0InUse, 67#L84-4true, 36#L65true, 19#L57-1true, 167#true, 1043#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), 203#true]) [2023-11-29 22:47:43,776 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L64-6-->L64-7: Formula: (<= v_~N~0_3 v_thread3Thread1of1ForFork0_~i~2_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][190], [thread2Thread1of1ForFork2InUse, 27#L64-7true, thread1Thread1of1ForFork1InUse, 185#true, 15#L48-5true, thread3Thread1of1ForFork0InUse, 1045#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 67#L84-4true, 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 19#L57-1true, 167#true, 203#true]) [2023-11-29 22:47:43,776 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 22:47:43,776 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 22:47:43,992 INFO L124 PetriNetUnfolderBase]: 3969/7513 cut-off events. [2023-11-29 22:47:43,992 INFO L125 PetriNetUnfolderBase]: For 16313/19165 co-relation queries the response was YES. [2023-11-29 22:47:44,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27495 conditions, 7513 events. 3969/7513 cut-off events. For 16313/19165 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 59670 event pairs, 871 based on Foata normal form. 30/5779 useless extension candidates. Maximal degree in co-relation 25430. Up to 4478 conditions per place. [2023-11-29 22:47:44,056 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 131 selfloop transitions, 27 changer transitions 60/337 dead transitions. [2023-11-29 22:47:44,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 337 transitions, 2830 flow [2023-11-29 22:47:44,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 22:47:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 22:47:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1261 transitions. [2023-11-29 22:47:44,059 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7596385542168674 [2023-11-29 22:47:44,060 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1261 transitions. [2023-11-29 22:47:44,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1261 transitions. [2023-11-29 22:47:44,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:44,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1261 transitions. [2023-11-29 22:47:44,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 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-11-29 22:47:44,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 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-11-29 22:47:44,065 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 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-11-29 22:47:44,066 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 55 predicate places. [2023-11-29 22:47:44,066 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 337 transitions, 2830 flow [2023-11-29 22:47:44,067 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:44,067 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:44,067 INFO L232 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, 1, 1, 1, 1, 1, 1] [2023-11-29 22:47:44,076 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-11-29 22:47:44,274 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:44,274 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-11-29 22:47:44,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1754565882, now seen corresponding path program 2 times [2023-11-29 22:47:44,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:44,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127593096] [2023-11-29 22:47:44,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:44,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127593096] [2023-11-29 22:47:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127593096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:44,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058482499] [2023-11-29 22:47:44,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:47:44,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:44,419 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-11-29 22:47:44,447 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-11-29 22:47:44,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:47:44,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:47:44,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:47:44,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:47:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:44,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:47:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058482499] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:47:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-11-29 22:47:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45252826] [2023-11-29 22:47:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:44,784 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:47:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:47:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-29 22:47:44,785 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-11-29 22:47:44,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 337 transitions, 2830 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:44,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:44,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-11-29 22:47:44,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:45,901 INFO L124 PetriNetUnfolderBase]: 3996/8245 cut-off events. [2023-11-29 22:47:45,901 INFO L125 PetriNetUnfolderBase]: For 19516/22463 co-relation queries the response was YES. [2023-11-29 22:47:45,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34412 conditions, 8245 events. 3996/8245 cut-off events. For 19516/22463 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 70758 event pairs, 727 based on Foata normal form. 205/6848 useless extension candidates. Maximal degree in co-relation 31892. Up to 4681 conditions per place. [2023-11-29 22:47:45,965 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 211 selfloop transitions, 35 changer transitions 61/426 dead transitions. [2023-11-29 22:47:45,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 426 transitions, 4363 flow [2023-11-29 22:47:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 22:47:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 22:47:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1374 transitions. [2023-11-29 22:47:45,968 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7524644030668127 [2023-11-29 22:47:45,968 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1374 transitions. [2023-11-29 22:47:45,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1374 transitions. [2023-11-29 22:47:45,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:45,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1374 transitions. [2023-11-29 22:47:45,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 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-11-29 22:47:45,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 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-11-29 22:47:45,975 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 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-11-29 22:47:45,975 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 65 predicate places. [2023-11-29 22:47:45,975 INFO L500 AbstractCegarLoop]: Abstraction has has 215 places, 426 transitions, 4363 flow [2023-11-29 22:47:45,975 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:45,975 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:45,976 INFO L232 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, 1, 1, 1, 1, 1, 1] [2023-11-29 22:47:45,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 22:47:46,180 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,SelfDestructingSolverStorable5 [2023-11-29 22:47:46,181 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-11-29 22:47:46,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1818984000, now seen corresponding path program 3 times [2023-11-29 22:47:46,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105232008] [2023-11-29 22:47:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105232008] [2023-11-29 22:47:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105232008] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184650075] [2023-11-29 22:47:46,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 22:47:46,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:46,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:46,326 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-11-29 22:47:46,350 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-11-29 22:47:46,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 22:47:46,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:47:46,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:47:46,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:47:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:46,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:47:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184650075] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:46,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:47:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-11-29 22:47:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858902844] [2023-11-29 22:47:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:46,667 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:47:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:46,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:47:46,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-11-29 22:47:46,669 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-11-29 22:47:46,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 426 transitions, 4363 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:46,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:46,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-11-29 22:47:46,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:48,169 INFO L124 PetriNetUnfolderBase]: 5491/11445 cut-off events. [2023-11-29 22:47:48,169 INFO L125 PetriNetUnfolderBase]: For 32052/36218 co-relation queries the response was YES. [2023-11-29 22:47:48,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55505 conditions, 11445 events. 5491/11445 cut-off events. For 32052/36218 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 103389 event pairs, 665 based on Foata normal form. 117/9540 useless extension candidates. Maximal degree in co-relation 52397. Up to 6656 conditions per place. [2023-11-29 22:47:48,330 INFO L140 encePairwiseOnDemand]: 151/166 looper letters, 439 selfloop transitions, 61 changer transitions 66/685 dead transitions. [2023-11-29 22:47:48,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 685 transitions, 8767 flow [2023-11-29 22:47:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 22:47:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 22:47:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1628 transitions. [2023-11-29 22:47:48,333 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7544022242817423 [2023-11-29 22:47:48,333 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1628 transitions. [2023-11-29 22:47:48,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1628 transitions. [2023-11-29 22:47:48,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:48,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1628 transitions. [2023-11-29 22:47:48,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 125.23076923076923) internal successors, (1628), 13 states have internal predecessors, (1628), 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-11-29 22:47:48,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 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-11-29 22:47:48,339 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 166.0) internal successors, (2324), 14 states have internal predecessors, (2324), 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-11-29 22:47:48,339 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 77 predicate places. [2023-11-29 22:47:48,339 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 685 transitions, 8767 flow [2023-11-29 22:47:48,340 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:48,340 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:48,340 INFO L232 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, 1, 1, 1, 1, 1, 1] [2023-11-29 22:47:48,347 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-11-29 22:47:48,545 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:48,545 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-11-29 22:47:48,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:48,546 INFO L85 PathProgramCache]: Analyzing trace with hash -738511726, now seen corresponding path program 4 times [2023-11-29 22:47:48,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:48,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834986798] [2023-11-29 22:47:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:48,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:48,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834986798] [2023-11-29 22:47:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834986798] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:48,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141265572] [2023-11-29 22:47:48,692 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 22:47:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:48,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:48,693 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-11-29 22:47:48,717 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-11-29 22:47:48,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 22:47:48,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:47:48,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:47:48,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:47:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:48,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:47:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:49,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141265572] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:49,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:47:49,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2023-11-29 22:47:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922137088] [2023-11-29 22:47:49,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:49,068 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:47:49,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:47:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-11-29 22:47:49,069 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-11-29 22:47:49,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 685 transitions, 8767 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:49,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:49,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-11-29 22:47:49,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:50,861 INFO L124 PetriNetUnfolderBase]: 5922/12473 cut-off events. [2023-11-29 22:47:50,861 INFO L125 PetriNetUnfolderBase]: For 44452/50722 co-relation queries the response was YES. [2023-11-29 22:47:50,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68709 conditions, 12473 events. 5922/12473 cut-off events. For 44452/50722 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 115714 event pairs, 697 based on Foata normal form. 383/10691 useless extension candidates. Maximal degree in co-relation 64913. Up to 7087 conditions per place. [2023-11-29 22:47:50,980 INFO L140 encePairwiseOnDemand]: 150/166 looper letters, 486 selfloop transitions, 73 changer transitions 67/745 dead transitions. [2023-11-29 22:47:50,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 745 transitions, 10863 flow [2023-11-29 22:47:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 22:47:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 22:47:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1390 transitions. [2023-11-29 22:47:50,983 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7612267250821467 [2023-11-29 22:47:50,983 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1390 transitions. [2023-11-29 22:47:50,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1390 transitions. [2023-11-29 22:47:50,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:50,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1390 transitions. [2023-11-29 22:47:50,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.36363636363636) internal successors, (1390), 11 states have internal predecessors, (1390), 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-11-29 22:47:50,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 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-11-29 22:47:50,988 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 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-11-29 22:47:50,989 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 87 predicate places. [2023-11-29 22:47:50,989 INFO L500 AbstractCegarLoop]: Abstraction has has 237 places, 745 transitions, 10863 flow [2023-11-29 22:47:50,989 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:50,989 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:50,989 INFO L232 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, 1, 1, 1, 1, 1, 1] [2023-11-29 22:47:50,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 22:47:51,194 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:51,195 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-11-29 22:47:51,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -949544852, now seen corresponding path program 5 times [2023-11-29 22:47:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:51,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275514084] [2023-11-29 22:47:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275514084] [2023-11-29 22:47:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275514084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876026151] [2023-11-29 22:47:51,346 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 22:47:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:51,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:51,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:47:51,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 22:47:51,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:47:51,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:47:51,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 22:47:51,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:47:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:51,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:47:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:51,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876026151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:47:51,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:47:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-11-29 22:47:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446239294] [2023-11-29 22:47:51,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:47:51,650 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 22:47:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:51,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 22:47:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-29 22:47:51,652 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 166 [2023-11-29 22:47:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 745 transitions, 10863 flow. Second operand has 16 states, 16 states have (on average 114.125) internal successors, (1826), 16 states have internal predecessors, (1826), 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-11-29 22:47:51,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 166 [2023-11-29 22:47:51,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:54,872 INFO L124 PetriNetUnfolderBase]: 9449/18309 cut-off events. [2023-11-29 22:47:54,872 INFO L125 PetriNetUnfolderBase]: For 59918/67481 co-relation queries the response was YES. [2023-11-29 22:47:54,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103810 conditions, 18309 events. 9449/18309 cut-off events. For 59918/67481 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 164698 event pairs, 702 based on Foata normal form. 404/16611 useless extension candidates. Maximal degree in co-relation 99225. Up to 8466 conditions per place. [2023-11-29 22:47:55,058 INFO L140 encePairwiseOnDemand]: 143/166 looper letters, 797 selfloop transitions, 314 changer transitions 74/1299 dead transitions. [2023-11-29 22:47:55,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1299 transitions, 20408 flow [2023-11-29 22:47:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 22:47:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-29 22:47:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3798 transitions. [2023-11-29 22:47:55,064 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7380489700738437 [2023-11-29 22:47:55,065 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3798 transitions. [2023-11-29 22:47:55,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3798 transitions. [2023-11-29 22:47:55,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:55,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3798 transitions. [2023-11-29 22:47:55,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 122.51612903225806) internal successors, (3798), 31 states have internal predecessors, (3798), 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-11-29 22:47:55,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 166.0) internal successors, (5312), 32 states have internal predecessors, (5312), 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-11-29 22:47:55,076 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 166.0) internal successors, (5312), 32 states have internal predecessors, (5312), 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-11-29 22:47:55,077 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 117 predicate places. [2023-11-29 22:47:55,077 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 1299 transitions, 20408 flow [2023-11-29 22:47:55,077 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 114.125) internal successors, (1826), 16 states have internal predecessors, (1826), 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-11-29 22:47:55,078 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:55,078 INFO L232 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, 1, 1, 1, 1, 1, 1] [2023-11-29 22:47:55,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 22:47:55,282 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:55,282 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-11-29 22:47:55,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 738365578, now seen corresponding path program 6 times [2023-11-29 22:47:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573457593] [2023-11-29 22:47:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:55,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573457593] [2023-11-29 22:47:55,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573457593] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:55,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607172980] [2023-11-29 22:47:55,401 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 22:47:55,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:55,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:47:55,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 22:47:55,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-29 22:47:55,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:47:55,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:47:55,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:47:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:55,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:47:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:55,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607172980] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:55,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:47:55,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2023-11-29 22:47:55,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49772220] [2023-11-29 22:47:55,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:55,825 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:47:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:55,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:47:55,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-11-29 22:47:55,826 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2023-11-29 22:47:55,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 1299 transitions, 20408 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:55,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:55,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2023-11-29 22:47:55,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:47:59,114 INFO L124 PetriNetUnfolderBase]: 9372/18217 cut-off events. [2023-11-29 22:47:59,115 INFO L125 PetriNetUnfolderBase]: For 70660/79841 co-relation queries the response was YES. [2023-11-29 22:47:59,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114215 conditions, 18217 events. 9372/18217 cut-off events. For 70660/79841 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 164268 event pairs, 748 based on Foata normal form. 450/16580 useless extension candidates. Maximal degree in co-relation 103573. Up to 8409 conditions per place. [2023-11-29 22:47:59,298 INFO L140 encePairwiseOnDemand]: 149/166 looper letters, 792 selfloop transitions, 200 changer transitions 59/1253 dead transitions. [2023-11-29 22:47:59,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1253 transitions, 21656 flow [2023-11-29 22:47:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 22:47:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 22:47:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1260 transitions. [2023-11-29 22:47:59,300 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7590361445783133 [2023-11-29 22:47:59,300 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1260 transitions. [2023-11-29 22:47:59,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1260 transitions. [2023-11-29 22:47:59,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:47:59,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1260 transitions. [2023-11-29 22:47:59,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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-11-29 22:47:59,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 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-11-29 22:47:59,304 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 166.0) internal successors, (1826), 11 states have internal predecessors, (1826), 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-11-29 22:47:59,304 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 126 predicate places. [2023-11-29 22:47:59,304 INFO L500 AbstractCegarLoop]: Abstraction has has 276 places, 1253 transitions, 21656 flow [2023-11-29 22:47:59,304 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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-11-29 22:47:59,305 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:47:59,305 INFO L232 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, 1, 1, 1, 1, 1, 1] [2023-11-29 22:47:59,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 22:47:59,509 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:59,510 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-11-29 22:47:59,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:47:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 33721068, now seen corresponding path program 1 times [2023-11-29 22:47:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:47:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504396346] [2023-11-29 22:47:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:47:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:47:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504396346] [2023-11-29 22:47:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504396346] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184321816] [2023-11-29 22:47:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:47:59,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:47:59,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:47:59,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:47:59,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 22:47:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:47:59,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 22:47:59,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:47:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:59,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:47:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:47:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184321816] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:47:59,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:47:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-29 22:47:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104800792] [2023-11-29 22:47:59,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:47:59,885 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 22:47:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:47:59,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 22:47:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-29 22:47:59,886 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 166 [2023-11-29 22:47:59,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1253 transitions, 21656 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-29 22:47:59,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:47:59,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 166 [2023-11-29 22:47:59,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:48:02,318 INFO L124 PetriNetUnfolderBase]: 7583/14451 cut-off events. [2023-11-29 22:48:02,318 INFO L125 PetriNetUnfolderBase]: For 67110/72258 co-relation queries the response was YES. [2023-11-29 22:48:02,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94678 conditions, 14451 events. 7583/14451 cut-off events. For 67110/72258 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 121925 event pairs, 579 based on Foata normal form. 44/13000 useless extension candidates. Maximal degree in co-relation 90699. Up to 6469 conditions per place. [2023-11-29 22:48:02,457 INFO L140 encePairwiseOnDemand]: 155/166 looper letters, 483 selfloop transitions, 101 changer transitions 57/1135 dead transitions. [2023-11-29 22:48:02,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1135 transitions, 20110 flow [2023-11-29 22:48:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 22:48:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 22:48:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-11-29 22:48:02,458 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7943201376936316 [2023-11-29 22:48:02,458 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-11-29 22:48:02,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-11-29 22:48:02,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:48:02,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-11-29 22:48:02,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 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-11-29 22:48:02,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 166.0) internal successors, (1328), 8 states have internal predecessors, (1328), 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-11-29 22:48:02,461 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 166.0) internal successors, (1328), 8 states have internal predecessors, (1328), 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-11-29 22:48:02,461 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 130 predicate places. [2023-11-29 22:48:02,462 INFO L500 AbstractCegarLoop]: Abstraction has has 280 places, 1135 transitions, 20110 flow [2023-11-29 22:48:02,462 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-29 22:48:02,462 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:48:02,462 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:48:02,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 22:48:02,667 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:48:02,667 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:48:02,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:48:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 607402708, now seen corresponding path program 1 times [2023-11-29 22:48:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:48:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559545908] [2023-11-29 22:48:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:48:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:48:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:48:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:48:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:48:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559545908] [2023-11-29 22:48:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559545908] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:48:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036353962] [2023-11-29 22:48:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:48:03,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:48:03,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:48:03,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:48:03,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 22:48:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:48:03,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 22:48:03,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:48:04,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-29 22:48:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:48:04,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:48:04,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:48:04,250 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 24 treesize of output 21 [2023-11-29 22:48:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:48:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036353962] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:48:04,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:48:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 12] total 31 [2023-11-29 22:48:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599505707] [2023-11-29 22:48:04,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:48:04,825 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 22:48:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:48:04,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 22:48:04,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2023-11-29 22:48:04,827 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 166 [2023-11-29 22:48:04,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 1135 transitions, 20110 flow. Second operand has 31 states, 31 states have (on average 82.90322580645162) internal successors, (2570), 31 states have internal predecessors, (2570), 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-11-29 22:48:04,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:48:04,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 166 [2023-11-29 22:48:04,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:48:13,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2110], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 29#L56-4true, 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 47#L49-2true, 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0))]) [2023-11-29 22:48:13,333 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 22:48:13,333 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 22:48:13,333 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 22:48:13,333 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 22:48:13,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 |v_thread1Thread1of1ForFork1_#t~post1_1|) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1][771], [thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, 235#true, thread3Thread1of1ForFork0InUse, 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 145#L48-4true, 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 127#L57-2true]) [2023-11-29 22:48:13,593 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2023-11-29 22:48:13,593 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2023-11-29 22:48:13,593 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2023-11-29 22:48:13,593 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2023-11-29 22:48:13,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2110], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 29#L56-4true, 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 80#L48-3true, 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 167#true, 203#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0))]) [2023-11-29 22:48:13,705 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 22:48:13,705 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 22:48:13,705 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 22:48:13,705 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 22:48:13,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 |v_thread1Thread1of1ForFork1_#t~post1_1|) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1][771], [thread2Thread1of1ForFork2InUse, 235#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 3394#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 3409#(and (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), 122#L56-3true, 145#L48-4true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 4993#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 115#L68true, 271#(<= 1 ~N~0), 185#true, 2603#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0))]) [2023-11-29 22:48:13,705 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 22:48:13,705 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 22:48:13,705 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 22:48:13,705 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 22:48:15,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2483], [3408#(<= 1 ~N~0), 1836#(<= 1 ~N~0), thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 29#L56-4true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 47#L49-2true, 1041#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 27#L64-7true, 3400#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 4999#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 185#true, 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2)]) [2023-11-29 22:48:15,618 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2023-11-29 22:48:15,618 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 22:48:15,618 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 22:48:15,618 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 22:48:15,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L56-3-->L56-4: Formula: (= |v_thread2Thread1of1ForFork2_#t~post3_1| v_thread2Thread1of1ForFork2_~i~1_11) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3][2483], [1836#(<= 1 ~N~0), 3408#(<= 1 ~N~0), thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 29#L56-4true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 80#L48-3true, 1041#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 167#true, 203#true, 57#L85-1true, 27#L64-7true, 185#true, 3400#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 4999#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2)]) [2023-11-29 22:48:15,786 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-29 22:48:15,786 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 22:48:15,786 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 22:48:15,786 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-29 22:48:15,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_11 |v_thread1Thread1of1ForFork1_#t~post1_1|) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_11, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1][230], [1836#(<= 1 ~N~0), 3408#(<= 1 ~N~0), thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 145#L48-4true, 122#L56-3true, 1828#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= 1 ~M~0)), 1041#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), 5772#true, 5770#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 203#true, 167#true, 57#L85-1true, 27#L64-7true, 185#true, 4999#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 3400#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0)), 245#(<= ~N~0 thread3Thread1of1ForFork0_~i~2)]) [2023-11-29 22:48:15,947 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is not cut-off event [2023-11-29 22:48:15,947 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2023-11-29 22:48:15,947 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2023-11-29 22:48:15,947 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2023-11-29 22:48:16,712 INFO L124 PetriNetUnfolderBase]: 38087/62760 cut-off events. [2023-11-29 22:48:16,713 INFO L125 PetriNetUnfolderBase]: For 300721/307358 co-relation queries the response was YES. [2023-11-29 22:48:17,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398741 conditions, 62760 events. 38087/62760 cut-off events. For 300721/307358 co-relation queries the response was YES. Maximal size of possible extension queue 2504. Compared 557875 event pairs, 2442 based on Foata normal form. 215/56934 useless extension candidates. Maximal degree in co-relation 362241. Up to 24715 conditions per place. [2023-11-29 22:48:17,477 INFO L140 encePairwiseOnDemand]: 135/166 looper letters, 2026 selfloop transitions, 265 changer transitions 70/2694 dead transitions. [2023-11-29 22:48:17,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 2694 transitions, 50635 flow [2023-11-29 22:48:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 22:48:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-29 22:48:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3346 transitions. [2023-11-29 22:48:17,480 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5304375396322131 [2023-11-29 22:48:17,480 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3346 transitions. [2023-11-29 22:48:17,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3346 transitions. [2023-11-29 22:48:17,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:48:17,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3346 transitions. [2023-11-29 22:48:17,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 88.05263157894737) internal successors, (3346), 38 states have internal predecessors, (3346), 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-11-29 22:48:17,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 166.0) internal successors, (6474), 39 states have internal predecessors, (6474), 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-11-29 22:48:17,488 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 166.0) internal successors, (6474), 39 states have internal predecessors, (6474), 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-11-29 22:48:17,489 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 167 predicate places. [2023-11-29 22:48:17,489 INFO L500 AbstractCegarLoop]: Abstraction has has 317 places, 2694 transitions, 50635 flow [2023-11-29 22:48:17,489 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 82.90322580645162) internal successors, (2570), 31 states have internal predecessors, (2570), 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-11-29 22:48:17,489 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:48:17,490 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:48:17,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 22:48:17,694 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 22:48:17,695 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:48:17,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:48:17,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1370539680, now seen corresponding path program 1 times [2023-11-29 22:48:17,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:48:17,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787404518] [2023-11-29 22:48:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:48:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:48:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:48:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:48:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:48:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787404518] [2023-11-29 22:48:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787404518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:48:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444273006] [2023-11-29 22:48:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:48:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:48:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:48:19,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:48:19,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 22:48:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:48:19,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 22:48:19,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:48:20,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:48:20,690 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 17 treesize of output 15 [2023-11-29 22:48:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:48:20,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:48:21,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:48:21,214 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 28 treesize of output 21 [2023-11-29 22:48:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:48:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444273006] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:48:22,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:48:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 27, 21] total 73 [2023-11-29 22:48:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447788754] [2023-11-29 22:48:22,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:48:22,224 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-29 22:48:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:48:22,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-29 22:48:22,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=4422, Unknown=0, NotChecked=0, Total=5256 [2023-11-29 22:48:22,228 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 166 [2023-11-29 22:48:22,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 2694 transitions, 50635 flow. Second operand has 73 states, 73 states have (on average 50.534246575342465) internal successors, (3689), 73 states have internal predecessors, (3689), 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-11-29 22:48:22,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:48:22,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 166 [2023-11-29 22:48:22,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:49:07,950 INFO L124 PetriNetUnfolderBase]: 88704/137533 cut-off events. [2023-11-29 22:49:07,950 INFO L125 PetriNetUnfolderBase]: For 834161/835731 co-relation queries the response was YES. [2023-11-29 22:49:08,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936524 conditions, 137533 events. 88704/137533 cut-off events. For 834161/835731 co-relation queries the response was YES. Maximal size of possible extension queue 5962. Compared 1247972 event pairs, 7647 based on Foata normal form. 174/126690 useless extension candidates. Maximal degree in co-relation 723102. Up to 59621 conditions per place. [2023-11-29 22:49:09,929 INFO L140 encePairwiseOnDemand]: 116/166 looper letters, 6565 selfloop transitions, 1219 changer transitions 105/7934 dead transitions. [2023-11-29 22:49:09,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 7934 transitions, 159937 flow [2023-11-29 22:49:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-11-29 22:49:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2023-11-29 22:49:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 5663 transitions. [2023-11-29 22:49:09,944 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.341144578313253 [2023-11-29 22:49:09,944 INFO L72 ComplementDD]: Start complementDD. Operand 100 states and 5663 transitions. [2023-11-29 22:49:09,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 5663 transitions. [2023-11-29 22:49:09,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:49:09,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 100 states and 5663 transitions. [2023-11-29 22:49:09,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 101 states, 100 states have (on average 56.63) internal successors, (5663), 100 states have internal predecessors, (5663), 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-11-29 22:49:09,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 101 states, 101 states have (on average 166.0) internal successors, (16766), 101 states have internal predecessors, (16766), 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-11-29 22:49:09,975 INFO L81 ComplementDD]: Finished complementDD. Result has 101 states, 101 states have (on average 166.0) internal successors, (16766), 101 states have internal predecessors, (16766), 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-11-29 22:49:09,975 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 266 predicate places. [2023-11-29 22:49:09,975 INFO L500 AbstractCegarLoop]: Abstraction has has 416 places, 7934 transitions, 159937 flow [2023-11-29 22:49:09,976 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 50.534246575342465) internal successors, (3689), 73 states have internal predecessors, (3689), 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-11-29 22:49:09,976 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:49:09,976 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:49:09,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 22:49:10,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 22:49:10,182 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:49:10,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:49:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1698572326, now seen corresponding path program 2 times [2023-11-29 22:49:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:49:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717533251] [2023-11-29 22:49:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:49:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:49:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:49:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:49:11,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:49:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717533251] [2023-11-29 22:49:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717533251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:49:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503885125] [2023-11-29 22:49:11,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:49:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:49:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:49:11,729 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:49:11,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 22:49:11,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:49:11,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:49:11,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 22:49:11,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:49:12,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:49:12,580 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 16 treesize of output 11 [2023-11-29 22:49:12,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:49:12,700 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 19 treesize of output 15 [2023-11-29 22:49:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:49:12,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:49:13,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:49:13,521 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 64 treesize of output 48 [2023-11-29 22:49:13,524 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 22 treesize of output 16 [2023-11-29 22:49:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:49:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503885125] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:49:14,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:49:14,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 26, 25] total 76 [2023-11-29 22:49:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082908523] [2023-11-29 22:49:14,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:49:14,488 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-11-29 22:49:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:49:14,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-11-29 22:49:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=5005, Unknown=6, NotChecked=0, Total=5700 [2023-11-29 22:49:14,491 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 166 [2023-11-29 22:49:14,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 7934 transitions, 159937 flow. Second operand has 76 states, 76 states have (on average 47.43421052631579) internal successors, (3605), 76 states have internal predecessors, (3605), 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-11-29 22:49:14,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:49:14,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 166 [2023-11-29 22:49:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:52:35,104 INFO L124 PetriNetUnfolderBase]: 131560/205704 cut-off events. [2023-11-29 22:52:35,105 INFO L125 PetriNetUnfolderBase]: For 1301057/1304954 co-relation queries the response was YES. [2023-11-29 22:52:36,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585305 conditions, 205704 events. 131560/205704 cut-off events. For 1301057/1304954 co-relation queries the response was YES. Maximal size of possible extension queue 8803. Compared 1978671 event pairs, 6703 based on Foata normal form. 360/189628 useless extension candidates. Maximal degree in co-relation 1145236. Up to 101112 conditions per place. [2023-11-29 22:52:38,441 INFO L140 encePairwiseOnDemand]: 114/166 looper letters, 10936 selfloop transitions, 4033 changer transitions 165/15176 dead transitions. [2023-11-29 22:52:38,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 15176 transitions, 330147 flow [2023-11-29 22:52:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2023-11-29 22:52:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2023-11-29 22:52:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 6986 transitions. [2023-11-29 22:52:38,456 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3262351732511441 [2023-11-29 22:52:38,456 INFO L72 ComplementDD]: Start complementDD. Operand 129 states and 6986 transitions. [2023-11-29 22:52:38,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 6986 transitions. [2023-11-29 22:52:38,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:52:38,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 129 states and 6986 transitions. [2023-11-29 22:52:38,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 130 states, 129 states have (on average 54.15503875968992) internal successors, (6986), 129 states have internal predecessors, (6986), 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-11-29 22:52:38,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 130 states, 130 states have (on average 166.0) internal successors, (21580), 130 states have internal predecessors, (21580), 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-11-29 22:52:38,482 INFO L81 ComplementDD]: Finished complementDD. Result has 130 states, 130 states have (on average 166.0) internal successors, (21580), 130 states have internal predecessors, (21580), 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-11-29 22:52:38,482 INFO L307 CegarLoopForPetriNet]: 150 programPoint places, 394 predicate places. [2023-11-29 22:52:38,482 INFO L500 AbstractCegarLoop]: Abstraction has has 544 places, 15176 transitions, 330147 flow [2023-11-29 22:52:38,483 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 47.43421052631579) internal successors, (3605), 76 states have internal predecessors, (3605), 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-11-29 22:52:38,483 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:52:38,483 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:52:38,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 22:52:38,688 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 22:52:38,688 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:52:38,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:52:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash -736134050, now seen corresponding path program 2 times [2023-11-29 22:52:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:52:38,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832046817] [2023-11-29 22:52:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:52:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:52:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:52:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:52:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:52:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832046817] [2023-11-29 22:52:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832046817] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:52:39,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419732669] [2023-11-29 22:52:39,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:52:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:52:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:52:39,526 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:52:39,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 22:52:39,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:52:39,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:52:39,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 22:52:39,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:52:40,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:52:40,345 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 16 treesize of output 11 [2023-11-29 22:52:40,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-29 22:52:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:52:40,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:52:40,584 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~A~0.base) c_~A~0.offset) c_~sum3~0 c_~sum2~0) 4294967296) (mod c_~sum1~0 4294967296))) is different from false [2023-11-29 22:52:40,601 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_410) c_~A~0.base) c_~A~0.offset) c_~sum3~0 c_~sum2~0) 4294967296) (mod (+ |c_thread1Thread1of1ForFork1_#t~mem2| c_~sum1~0) 4294967296))) is different from false [2023-11-29 22:52:40,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:52:40,608 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 56 treesize of output 44 [2023-11-29 22:52:40,611 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 18 treesize of output 16 [2023-11-29 22:52:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-29 22:52:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419732669] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:52:41,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:52:41,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 19] total 49 [2023-11-29 22:52:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564657550] [2023-11-29 22:52:41,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:52:41,155 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-29 22:52:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:52:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-29 22:52:41,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1868, Unknown=5, NotChecked=182, Total=2352 [2023-11-29 22:52:41,158 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 166 [2023-11-29 22:52:41,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 15176 transitions, 330147 flow. Second operand has 49 states, 49 states have (on average 71.22448979591837) internal successors, (3490), 49 states have internal predecessors, (3490), 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-11-29 22:52:41,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:52:41,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 166 [2023-11-29 22:52:41,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 23:00:48,734 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:00:48,777 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:00:49,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 23:00:49,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-11-29 23:00:50,116 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-29 23:00:50,117 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 23:00:50,117 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-29 23:00:50,118 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-29 23:00:50,118 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 23:00:50,118 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-29 23:00:50,118 INFO L457 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 23:00:50,121 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 23:00:50,121 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 23:00:50,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:00:50 BasicIcfg [2023-11-29 23:00:50,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 23:00:50,124 INFO L158 Benchmark]: Toolchain (without parser) took 792196.02ms. Allocated memory was 354.4MB in the beginning and 13.0GB in the end (delta: 12.6GB). Free memory was 313.7MB in the beginning and 7.6GB in the end (delta: -7.3GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-11-29 23:00:50,124 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 354.4MB. Free memory is still 309.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 23:00:50,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.45ms. Allocated memory is still 354.4MB. Free memory was 313.3MB in the beginning and 301.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-29 23:00:50,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.64ms. Allocated memory is still 354.4MB. Free memory was 301.4MB in the beginning and 299.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:00:50,125 INFO L158 Benchmark]: Boogie Preprocessor took 17.29ms. Allocated memory is still 354.4MB. Free memory was 299.6MB in the beginning and 297.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:00:50,125 INFO L158 Benchmark]: RCFGBuilder took 334.09ms. Allocated memory is still 354.4MB. Free memory was 297.9MB in the beginning and 281.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-11-29 23:00:50,125 INFO L158 Benchmark]: TraceAbstraction took 791654.47ms. Allocated memory was 354.4MB in the beginning and 13.0GB in the end (delta: 12.6GB). Free memory was 280.3MB in the beginning and 7.6GB in the end (delta: -7.3GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-11-29 23:00:50,127 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 354.4MB. Free memory is still 309.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 160.45ms. Allocated memory is still 354.4MB. Free memory was 313.3MB in the beginning and 301.4MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 22.64ms. Allocated memory is still 354.4MB. Free memory was 301.4MB in the beginning and 299.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 17.29ms. Allocated memory is still 354.4MB. Free memory was 299.6MB in the beginning and 297.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 334.09ms. Allocated memory is still 354.4MB. Free memory was 297.9MB in the beginning and 281.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 791654.47ms. Allocated memory was 354.4MB in the beginning and 13.0GB in the end (delta: 12.6GB). Free memory was 280.3MB in the beginning and 7.6GB in the end (delta: -7.3GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 197 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 791.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 770.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5612 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5612 mSDsluCounter, 13851 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 637 IncrementalHoareTripleChecker+Unchecked, 12862 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22506 IncrementalHoareTripleChecker+Invalid, 23335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 989 mSDtfsCounter, 22506 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3373 GetRequests, 2655 SyntacticMatches, 20 SemanticMatches, 698 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 23263 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330147occurred in iteration=14, InterpolantAutomatonStates: 410, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 3293 NumberOfCodeBlocks, 3282 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4670 ConstructedInterpolants, 31 QuantifiedInterpolants, 33512 SizeOfPredicates, 147 NumberOfNonLiveVariables, 3375 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 39/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown