/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:22:13,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:22:14,053 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-SemanticLbe.epf [2023-11-17 16:22:14,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:22:14,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:22:14,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:22:14,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:22:14,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:22:14,079 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:22:14,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:22:14,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:22:14,082 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:22:14,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:22:14,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:22:14,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:22:14,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:22:14,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:22:14,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:22:14,084 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:22:14,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:22:14,084 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:22:14,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:22:14,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:22:14,085 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:22:14,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:22:14,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:22:14,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:22:14,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:22:14,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:22:14,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:22:14,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:22:14,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:22:14,088 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 [2023-11-17 16:22:14,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:22:14,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:22:14,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:22:14,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:22:14,303 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:22:14,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-11-17 16:22:15,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:22:15,562 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:22:15,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-11-17 16:22:15,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a90d4d15/988ea6175c874da2ac4840aaf9276a81/FLAG028477ba1 [2023-11-17 16:22:15,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a90d4d15/988ea6175c874da2ac4840aaf9276a81 [2023-11-17 16:22:15,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:22:15,585 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:22:15,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:22:15,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:22:15,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:22:15,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fad834c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15, skipping insertion in model container [2023-11-17 16:22:15,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,613 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:22:15,746 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-min-array.wvr.c[2592,2605] [2023-11-17 16:22:15,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:22:15,765 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:22:15,783 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-min-array.wvr.c[2592,2605] [2023-11-17 16:22:15,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:22:15,790 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:22:15,790 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:22:15,795 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:22:15,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15 WrapperNode [2023-11-17 16:22:15,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:22:15,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:22:15,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:22:15,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:22:15,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,819 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2023-11-17 16:22:15,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:22:15,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:22:15,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:22:15,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:22:15,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:22:15,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:22:15,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:22:15,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:22:15,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (1/1) ... [2023-11-17 16:22:15,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:22:15,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:15,862 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-17 16:22:15,877 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-17 16:22:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:22:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:22:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:22:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:22:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:22:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:22:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:22:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:22:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:22:15,895 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 16:22:15,962 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:22:15,963 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:22:16,185 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:22:16,233 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:22:16,233 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:22:16,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:22:16 BoogieIcfgContainer [2023-11-17 16:22:16,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:22:16,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:22:16,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:22:16,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:22:16,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:22:15" (1/3) ... [2023-11-17 16:22:16,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f7037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:22:16, skipping insertion in model container [2023-11-17 16:22:16,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:15" (2/3) ... [2023-11-17 16:22:16,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f7037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:22:16, skipping insertion in model container [2023-11-17 16:22:16,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:22:16" (3/3) ... [2023-11-17 16:22:16,242 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2023-11-17 16:22:16,255 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:22:16,255 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:22:16,255 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:22:16,339 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:22:16,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 159 transitions, 339 flow [2023-11-17 16:22:16,432 INFO L124 PetriNetUnfolderBase]: 12/156 cut-off events. [2023-11-17 16:22:16,432 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:22:16,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 12/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 102 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-11-17 16:22:16,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 159 transitions, 339 flow [2023-11-17 16:22:16,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 145 transitions, 308 flow [2023-11-17 16:22:16,442 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:22:16,450 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 145 transitions, 308 flow [2023-11-17 16:22:16,451 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 145 transitions, 308 flow [2023-11-17 16:22:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 145 transitions, 308 flow [2023-11-17 16:22:16,473 INFO L124 PetriNetUnfolderBase]: 12/145 cut-off events. [2023-11-17 16:22:16,473 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:22:16,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 12/145 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-11-17 16:22:16,475 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2023-11-17 16:22:19,975 INFO L134 LiptonReduction]: Checked pairs total: 1847 [2023-11-17 16:22:19,975 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-17 16:22:20,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:22:20,016 INFO L357 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=false, 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;@77078c86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:22:20,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:22:20,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:22:20,022 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-11-17 16:22:20,022 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:22:20,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:20,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:20,023 INFO L420 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-17 16:22:20,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -829075819, now seen corresponding path program 1 times [2023-11-17 16:22:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:20,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119146720] [2023-11-17 16:22:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:20,361 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-17 16:22:20,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119146720] [2023-11-17 16:22:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119146720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:22:20,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:22:20,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:22:20,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416619448] [2023-11-17 16:22:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:20,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:22:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:20,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:22:20,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:22:20,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 305 [2023-11-17 16:22:20,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:20,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:20,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 305 [2023-11-17 16:22:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:20,562 INFO L124 PetriNetUnfolderBase]: 429/632 cut-off events. [2023-11-17 16:22:20,562 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-17 16:22:20,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 632 events. 429/632 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2019 event pairs, 138 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1030. Up to 389 conditions per place. [2023-11-17 16:22:20,567 INFO L140 encePairwiseOnDemand]: 300/305 looper letters, 38 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2023-11-17 16:22:20,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 205 flow [2023-11-17 16:22:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:22:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:22:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-17 16:22:20,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005464480874317 [2023-11-17 16:22:20,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-17 16:22:20,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-17 16:22:20,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:20,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-17 16:22:20,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-17 16:22:20,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 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-17 16:22:20,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 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-17 16:22:20,602 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 458 transitions. [2023-11-17 16:22:20,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 205 flow [2023-11-17 16:22:20,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:22:20,609 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-17 16:22:20,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-17 16:22:20,616 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-11-17 16:22:20,616 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-17 16:22:20,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:20,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:20,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:20,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:22:20,618 INFO L420 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-17 16:22:20,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1731679178, now seen corresponding path program 1 times [2023-11-17 16:22:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197094715] [2023-11-17 16:22:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:20,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197094715] [2023-11-17 16:22:20,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197094715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:22:20,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:22:20,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:22:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350222599] [2023-11-17 16:22:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:20,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:22:20,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:22:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:22:20,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 305 [2023-11-17 16:22:20,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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-17 16:22:20,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:20,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 305 [2023-11-17 16:22:20,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:20,863 INFO L124 PetriNetUnfolderBase]: 429/633 cut-off events. [2023-11-17 16:22:20,864 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-17 16:22:20,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 633 events. 429/633 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1875 event pairs, 276 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 544. Up to 633 conditions per place. [2023-11-17 16:22:20,870 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-17 16:22:20,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 138 flow [2023-11-17 16:22:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:22:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:22:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-11-17 16:22:20,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42185792349726775 [2023-11-17 16:22:20,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-11-17 16:22:20,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-11-17 16:22:20,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:20,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-11-17 16:22:20,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:20,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 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-17 16:22:20,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 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-17 16:22:20,880 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 386 transitions. [2023-11-17 16:22:20,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 138 flow [2023-11-17 16:22:20,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:22:20,882 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-17 16:22:20,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-17 16:22:20,882 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-11-17 16:22:20,883 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-17 16:22:20,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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-17 16:22:20,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:20,884 INFO L208 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] [2023-11-17 16:22:20,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:22:20,886 INFO L420 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-17 16:22:20,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash -226678984, now seen corresponding path program 1 times [2023-11-17 16:22:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:20,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292600461] [2023-11-17 16:22:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:22:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292600461] [2023-11-17 16:22:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292600461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:22:20,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:22:20,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:22:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749606620] [2023-11-17 16:22:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:20,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:22:20,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:22:20,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:22:20,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 305 [2023-11-17 16:22:20,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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-17 16:22:20,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:20,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 305 [2023-11-17 16:22:20,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:21,099 INFO L124 PetriNetUnfolderBase]: 424/625 cut-off events. [2023-11-17 16:22:21,099 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-17 16:22:21,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 625 events. 424/625 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1868 event pairs, 186 based on Foata normal form. 50/674 useless extension candidates. Maximal degree in co-relation 1460. Up to 459 conditions per place. [2023-11-17 16:22:21,102 INFO L140 encePairwiseOnDemand]: 301/305 looper letters, 38 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-11-17 16:22:21,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 42 transitions, 212 flow [2023-11-17 16:22:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:22:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:22:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-11-17 16:22:21,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44016393442622953 [2023-11-17 16:22:21,104 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-11-17 16:22:21,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-11-17 16:22:21,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:21,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-11-17 16:22:21,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 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-17 16:22:21,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 305.0) internal successors, (1525), 5 states have internal predecessors, (1525), 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-17 16:22:21,107 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 305.0) internal successors, (1525), 5 states have internal predecessors, (1525), 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-17 16:22:21,107 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 4 states and 537 transitions. [2023-11-17 16:22:21,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 42 transitions, 212 flow [2023-11-17 16:22:21,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 206 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 16:22:21,109 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 101 flow [2023-11-17 16:22:21,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-11-17 16:22:21,110 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-11-17 16:22:21,110 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 101 flow [2023-11-17 16:22:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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-17 16:22:21,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:21,110 INFO L208 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] [2023-11-17 16:22:21,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:22:21,111 INFO L420 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-17 16:22:21,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1057524325, now seen corresponding path program 1 times [2023-11-17 16:22:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:21,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746345392] [2023-11-17 16:22:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:21,187 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-17 16:22:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746345392] [2023-11-17 16:22:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746345392] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:21,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924402522] [2023-11-17 16:22:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:21,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:21,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:21,190 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-17 16:22:21,204 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-17 16:22:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:21,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:22:21,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:21,327 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-17 16:22:21,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:21,352 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-17 16:22:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924402522] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:22:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 16:22:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798683532] [2023-11-17 16:22:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:21,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:22:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:22:21,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 16:22:21,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 305 [2023-11-17 16:22:21,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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-17 16:22:21,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:21,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 305 [2023-11-17 16:22:21,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:21,435 INFO L124 PetriNetUnfolderBase]: 410/599 cut-off events. [2023-11-17 16:22:21,435 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2023-11-17 16:22:21,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 599 events. 410/599 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1799 event pairs, 183 based on Foata normal form. 44/643 useless extension candidates. Maximal degree in co-relation 1603. Up to 452 conditions per place. [2023-11-17 16:22:21,438 INFO L140 encePairwiseOnDemand]: 300/305 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-11-17 16:22:21,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 246 flow [2023-11-17 16:22:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:22:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:22:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-11-17 16:22:21,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40524590163934426 [2023-11-17 16:22:21,440 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-11-17 16:22:21,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-11-17 16:22:21,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:21,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-11-17 16:22:21,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 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-17 16:22:21,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 305.0) internal successors, (1830), 6 states have internal predecessors, (1830), 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-17 16:22:21,445 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 305.0) internal successors, (1830), 6 states have internal predecessors, (1830), 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-17 16:22:21,445 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 101 flow. Second operand 5 states and 618 transitions. [2023-11-17 16:22:21,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 246 flow [2023-11-17 16:22:21,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 230 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 16:22:21,448 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 113 flow [2023-11-17 16:22:21,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-17 16:22:21,449 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-11-17 16:22:21,450 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 113 flow [2023-11-17 16:22:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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-17 16:22:21,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:21,450 INFO L208 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] [2023-11-17 16:22:21,461 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-17 16:22:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:21,662 INFO L420 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-17 16:22:21,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -366924251, now seen corresponding path program 1 times [2023-11-17 16:22:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:21,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772448777] [2023-11-17 16:22:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:22,171 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-17 16:22:22,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772448777] [2023-11-17 16:22:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772448777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228453535] [2023-11-17 16:22:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:22,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:22,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:22,173 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-17 16:22:22,219 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-17 16:22:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:22,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-17 16:22:22,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:22,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:22:22,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:22:22,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:22,504 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 38 treesize of output 29 [2023-11-17 16:22:22,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:22,600 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 38 treesize of output 29 [2023-11-17 16:22:22,714 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 58 treesize of output 34 [2023-11-17 16:22:22,768 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-17 16:22:22,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:22,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base) .cse0) c_~min2~0))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base) .cse0))) (or (< c_~min2~0 (+ .cse1 1)) (= c_~min1~0 .cse1)))))) is different from false [2023-11-17 16:22:23,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:23,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-17 16:22:23,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:23,448 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 648 treesize of output 620 [2023-11-17 16:22:23,463 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 271 treesize of output 223 [2023-11-17 16:22:23,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:23,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 112 [2023-11-17 16:22:23,491 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 117 treesize of output 93 [2023-11-17 16:22:23,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:23,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 55 [2023-11-17 16:22:23,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:22:23,898 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:22:23,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:22:23,904 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 76 treesize of output 64 [2023-11-17 16:22:23,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:22:23,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2023-11-17 16:22:23,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:23,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-11-17 16:22:23,936 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:22:23,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:22:23,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:22:23,943 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 51 treesize of output 43 [2023-11-17 16:22:23,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:22:23,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2023-11-17 16:22:23,970 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:23,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2023-11-17 16:22:24,004 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-17 16:22:24,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228453535] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:24,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:24,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-17 16:22:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198636289] [2023-11-17 16:22:24,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:24,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 16:22:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 16:22:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=489, Unknown=9, NotChecked=46, Total=650 [2023-11-17 16:22:24,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 305 [2023-11-17 16:22:24,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 113 flow. Second operand has 26 states, 26 states have (on average 84.26923076923077) internal successors, (2191), 26 states have internal predecessors, (2191), 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-17 16:22:24,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:24,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 305 [2023-11-17 16:22:24,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:24,840 INFO L124 PetriNetUnfolderBase]: 747/1095 cut-off events. [2023-11-17 16:22:24,840 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2023-11-17 16:22:24,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 1095 events. 747/1095 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3965 event pairs, 58 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 2725. Up to 647 conditions per place. [2023-11-17 16:22:24,846 INFO L140 encePairwiseOnDemand]: 296/305 looper letters, 80 selfloop transitions, 23 changer transitions 1/104 dead transitions. [2023-11-17 16:22:24,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 104 transitions, 550 flow [2023-11-17 16:22:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:22:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:22:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 923 transitions. [2023-11-17 16:22:24,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3026229508196721 [2023-11-17 16:22:24,849 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 923 transitions. [2023-11-17 16:22:24,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 923 transitions. [2023-11-17 16:22:24,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:24,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 923 transitions. [2023-11-17 16:22:24,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.3) internal successors, (923), 10 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-17 16:22:24,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:24,855 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:24,856 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 113 flow. Second operand 10 states and 923 transitions. [2023-11-17 16:22:24,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 104 transitions, 550 flow [2023-11-17 16:22:24,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 104 transitions, 534 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 16:22:24,858 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 262 flow [2023-11-17 16:22:24,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2023-11-17 16:22:24,859 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-11-17 16:22:24,859 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 262 flow [2023-11-17 16:22:24,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 84.26923076923077) internal successors, (2191), 26 states have internal predecessors, (2191), 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-17 16:22:24,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:24,860 INFO L208 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] [2023-11-17 16:22:24,871 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-17 16:22:25,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:25,065 INFO L420 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-17 16:22:25,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:25,065 INFO L85 PathProgramCache]: Analyzing trace with hash -824596411, now seen corresponding path program 2 times [2023-11-17 16:22:25,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:25,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618928451] [2023-11-17 16:22:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:25,474 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-17 16:22:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618928451] [2023-11-17 16:22:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618928451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488085826] [2023-11-17 16:22:25,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:22:25,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:25,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:25,489 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-17 16:22:25,517 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-17 16:22:25,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:25,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:25,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 16:22:25,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:25,847 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 59 treesize of output 35 [2023-11-17 16:22:25,902 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-17 16:22:25,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:25,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:25,995 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 89 treesize of output 49 [2023-11-17 16:22:26,133 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-17 16:22:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488085826] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:26,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:26,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2023-11-17 16:22:26,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747227300] [2023-11-17 16:22:26,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:26,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 16:22:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:26,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 16:22:26,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2023-11-17 16:22:26,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 305 [2023-11-17 16:22:26,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 262 flow. Second operand has 23 states, 23 states have (on average 91.8695652173913) internal successors, (2113), 23 states have internal predecessors, (2113), 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-17 16:22:26,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:26,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 305 [2023-11-17 16:22:26,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:26,651 INFO L124 PetriNetUnfolderBase]: 1015/1480 cut-off events. [2023-11-17 16:22:26,652 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2023-11-17 16:22:26,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 1480 events. 1015/1480 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5556 event pairs, 142 based on Foata normal form. 1/1480 useless extension candidates. Maximal degree in co-relation 4318. Up to 1030 conditions per place. [2023-11-17 16:22:26,661 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 89 selfloop transitions, 60 changer transitions 1/150 dead transitions. [2023-11-17 16:22:26,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 150 transitions, 990 flow [2023-11-17 16:22:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:22:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-17 16:22:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1823 transitions. [2023-11-17 16:22:26,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31458153580672993 [2023-11-17 16:22:26,665 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1823 transitions. [2023-11-17 16:22:26,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1823 transitions. [2023-11-17 16:22:26,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:26,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1823 transitions. [2023-11-17 16:22:26,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 95.94736842105263) internal successors, (1823), 19 states have internal predecessors, (1823), 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-17 16:22:26,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 305.0) internal successors, (6100), 20 states have internal predecessors, (6100), 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-17 16:22:26,674 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 305.0) internal successors, (6100), 20 states have internal predecessors, (6100), 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-17 16:22:26,674 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 262 flow. Second operand 19 states and 1823 transitions. [2023-11-17 16:22:26,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 150 transitions, 990 flow [2023-11-17 16:22:26,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 150 transitions, 929 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-17 16:22:26,679 INFO L231 Difference]: Finished difference. Result has 74 places, 95 transitions, 715 flow [2023-11-17 16:22:26,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=715, PETRI_PLACES=74, PETRI_TRANSITIONS=95} [2023-11-17 16:22:26,680 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2023-11-17 16:22:26,680 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 95 transitions, 715 flow [2023-11-17 16:22:26,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 91.8695652173913) internal successors, (2113), 23 states have internal predecessors, (2113), 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-17 16:22:26,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:26,681 INFO L208 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] [2023-11-17 16:22:26,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 16:22:26,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:26,886 INFO L420 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-17 16:22:26,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash 302518471, now seen corresponding path program 3 times [2023-11-17 16:22:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:26,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981123717] [2023-11-17 16:22:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:27,206 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-17 16:22:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981123717] [2023-11-17 16:22:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981123717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313201874] [2023-11-17 16:22:27,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:22:27,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:27,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:27,222 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-17 16:22:27,225 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-17 16:22:27,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:22:27,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:27,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 16:22:27,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:27,523 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 58 treesize of output 34 [2023-11-17 16:22:27,562 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-17 16:22:27,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:27,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:27,634 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 89 treesize of output 49 [2023-11-17 16:22:27,767 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-17 16:22:27,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313201874] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:27,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:27,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-11-17 16:22:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416025573] [2023-11-17 16:22:27,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:27,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:22:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:27,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:22:27,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:22:27,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 305 [2023-11-17 16:22:27,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 95 transitions, 715 flow. Second operand has 22 states, 22 states have (on average 91.77272727272727) internal successors, (2019), 22 states have internal predecessors, (2019), 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-17 16:22:27,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:27,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 305 [2023-11-17 16:22:27,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:28,398 INFO L124 PetriNetUnfolderBase]: 1210/1762 cut-off events. [2023-11-17 16:22:28,398 INFO L125 PetriNetUnfolderBase]: For 5748/5748 co-relation queries the response was YES. [2023-11-17 16:22:28,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8153 conditions, 1762 events. 1210/1762 cut-off events. For 5748/5748 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6839 event pairs, 173 based on Foata normal form. 1/1763 useless extension candidates. Maximal degree in co-relation 6796. Up to 1397 conditions per place. [2023-11-17 16:22:28,412 INFO L140 encePairwiseOnDemand]: 294/305 looper letters, 116 selfloop transitions, 87 changer transitions 1/204 dead transitions. [2023-11-17 16:22:28,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 204 transitions, 1766 flow [2023-11-17 16:22:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:22:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:22:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1921 transitions. [2023-11-17 16:22:28,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31491803278688524 [2023-11-17 16:22:28,417 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1921 transitions. [2023-11-17 16:22:28,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1921 transitions. [2023-11-17 16:22:28,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:28,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1921 transitions. [2023-11-17 16:22:28,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 96.05) internal successors, (1921), 20 states have internal predecessors, (1921), 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-17 16:22:28,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 305.0) internal successors, (6405), 21 states have internal predecessors, (6405), 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-17 16:22:28,427 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 305.0) internal successors, (6405), 21 states have internal predecessors, (6405), 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-17 16:22:28,427 INFO L175 Difference]: Start difference. First operand has 74 places, 95 transitions, 715 flow. Second operand 20 states and 1921 transitions. [2023-11-17 16:22:28,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 204 transitions, 1766 flow [2023-11-17 16:22:28,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 204 transitions, 1645 flow, removed 46 selfloop flow, removed 3 redundant places. [2023-11-17 16:22:28,442 INFO L231 Difference]: Finished difference. Result has 100 places, 144 transitions, 1307 flow [2023-11-17 16:22:28,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1307, PETRI_PLACES=100, PETRI_TRANSITIONS=144} [2023-11-17 16:22:28,443 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2023-11-17 16:22:28,443 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 144 transitions, 1307 flow [2023-11-17 16:22:28,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 91.77272727272727) internal successors, (2019), 22 states have internal predecessors, (2019), 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-17 16:22:28,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:28,443 INFO L208 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] [2023-11-17 16:22:28,465 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-17 16:22:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:28,648 INFO L420 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-17 16:22:28,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1712406779, now seen corresponding path program 4 times [2023-11-17 16:22:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:28,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053919225] [2023-11-17 16:22:28,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:28,997 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-17 16:22:28,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053919225] [2023-11-17 16:22:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053919225] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133703515] [2023-11-17 16:22:28,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:22:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:28,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:28,998 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-17 16:22:29,027 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-17 16:22:29,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:22:29,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:29,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-17 16:22:29,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:29,244 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 59 treesize of output 35 [2023-11-17 16:22:29,290 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-17 16:22:29,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:29,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:29,344 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 89 treesize of output 49 [2023-11-17 16:22:29,488 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-17 16:22:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133703515] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:29,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2023-11-17 16:22:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061371305] [2023-11-17 16:22:29,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:29,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 16:22:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 16:22:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-11-17 16:22:29,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 305 [2023-11-17 16:22:29,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 144 transitions, 1307 flow. Second operand has 23 states, 23 states have (on average 91.69565217391305) internal successors, (2109), 23 states have internal predecessors, (2109), 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-17 16:22:29,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:29,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 305 [2023-11-17 16:22:29,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:30,116 INFO L124 PetriNetUnfolderBase]: 1319/1928 cut-off events. [2023-11-17 16:22:30,117 INFO L125 PetriNetUnfolderBase]: For 7242/7242 co-relation queries the response was YES. [2023-11-17 16:22:30,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9490 conditions, 1928 events. 1319/1928 cut-off events. For 7242/7242 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7770 event pairs, 138 based on Foata normal form. 1/1929 useless extension candidates. Maximal degree in co-relation 8955. Up to 1525 conditions per place. [2023-11-17 16:22:30,128 INFO L140 encePairwiseOnDemand]: 294/305 looper letters, 120 selfloop transitions, 100 changer transitions 1/221 dead transitions. [2023-11-17 16:22:30,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 221 transitions, 2124 flow [2023-11-17 16:22:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:22:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-17 16:22:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1830 transitions. [2023-11-17 16:22:30,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2023-11-17 16:22:30,132 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1830 transitions. [2023-11-17 16:22:30,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1830 transitions. [2023-11-17 16:22:30,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:30,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1830 transitions. [2023-11-17 16:22:30,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 96.3157894736842) internal successors, (1830), 19 states have internal predecessors, (1830), 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-17 16:22:30,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 305.0) internal successors, (6100), 20 states have internal predecessors, (6100), 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-17 16:22:30,142 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 305.0) internal successors, (6100), 20 states have internal predecessors, (6100), 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-17 16:22:30,142 INFO L175 Difference]: Start difference. First operand has 100 places, 144 transitions, 1307 flow. Second operand 19 states and 1830 transitions. [2023-11-17 16:22:30,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 221 transitions, 2124 flow [2023-11-17 16:22:30,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 221 transitions, 2042 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-11-17 16:22:30,158 INFO L231 Difference]: Finished difference. Result has 118 places, 160 transitions, 1644 flow [2023-11-17 16:22:30,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1644, PETRI_PLACES=118, PETRI_TRANSITIONS=160} [2023-11-17 16:22:30,159 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2023-11-17 16:22:30,159 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 160 transitions, 1644 flow [2023-11-17 16:22:30,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 91.69565217391305) internal successors, (2109), 23 states have internal predecessors, (2109), 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-17 16:22:30,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:30,160 INFO L208 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] [2023-11-17 16:22:30,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-17 16:22:30,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:30,365 INFO L420 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-17 16:22:30,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 388256165, now seen corresponding path program 5 times [2023-11-17 16:22:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:30,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775177871] [2023-11-17 16:22:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:30,685 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-17 16:22:30,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:30,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775177871] [2023-11-17 16:22:30,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775177871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:30,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61924527] [2023-11-17 16:22:30,685 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:22:30,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:30,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:30,689 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-17 16:22:30,705 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-17 16:22:30,762 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:30,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:30,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:22:30,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:30,932 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 58 treesize of output 34 [2023-11-17 16:22:30,966 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-17 16:22:30,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:31,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:31,042 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 77 treesize of output 49 [2023-11-17 16:22:31,223 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-17 16:22:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61924527] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:31,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:31,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-11-17 16:22:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440764045] [2023-11-17 16:22:31,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:31,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:22:31,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:22:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:22:31,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 305 [2023-11-17 16:22:31,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 160 transitions, 1644 flow. Second operand has 19 states, 19 states have (on average 96.10526315789474) internal successors, (1826), 19 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-17 16:22:31,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:31,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 305 [2023-11-17 16:22:31,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:31,831 INFO L124 PetriNetUnfolderBase]: 1638/2387 cut-off events. [2023-11-17 16:22:31,831 INFO L125 PetriNetUnfolderBase]: For 11287/11287 co-relation queries the response was YES. [2023-11-17 16:22:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12306 conditions, 2387 events. 1638/2387 cut-off events. For 11287/11287 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9905 event pairs, 255 based on Foata normal form. 2/2389 useless extension candidates. Maximal degree in co-relation 11763. Up to 1669 conditions per place. [2023-11-17 16:22:31,852 INFO L140 encePairwiseOnDemand]: 295/305 looper letters, 137 selfloop transitions, 105 changer transitions 2/244 dead transitions. [2023-11-17 16:22:31,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 244 transitions, 2673 flow [2023-11-17 16:22:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 16:22:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 16:22:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1527 transitions. [2023-11-17 16:22:31,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33377049180327867 [2023-11-17 16:22:31,856 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1527 transitions. [2023-11-17 16:22:31,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1527 transitions. [2023-11-17 16:22:31,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:31,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1527 transitions. [2023-11-17 16:22:31,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.8) internal successors, (1527), 15 states have internal predecessors, (1527), 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-17 16:22:31,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 305.0) internal successors, (4880), 16 states have internal predecessors, (4880), 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-17 16:22:31,864 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 305.0) internal successors, (4880), 16 states have internal predecessors, (4880), 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-17 16:22:31,864 INFO L175 Difference]: Start difference. First operand has 118 places, 160 transitions, 1644 flow. Second operand 15 states and 1527 transitions. [2023-11-17 16:22:31,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 244 transitions, 2673 flow [2023-11-17 16:22:31,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 244 transitions, 2566 flow, removed 29 selfloop flow, removed 7 redundant places. [2023-11-17 16:22:31,897 INFO L231 Difference]: Finished difference. Result has 129 places, 187 transitions, 2054 flow [2023-11-17 16:22:31,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2054, PETRI_PLACES=129, PETRI_TRANSITIONS=187} [2023-11-17 16:22:31,898 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2023-11-17 16:22:31,898 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 187 transitions, 2054 flow [2023-11-17 16:22:31,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 96.10526315789474) internal successors, (1826), 19 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-17 16:22:31,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:31,899 INFO L208 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] [2023-11-17 16:22:31,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:32,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:32,104 INFO L420 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-17 16:22:32,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1156017093, now seen corresponding path program 6 times [2023-11-17 16:22:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291737186] [2023-11-17 16:22:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:32,389 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-17 16:22:32,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:32,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291737186] [2023-11-17 16:22:32,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291737186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:32,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741592543] [2023-11-17 16:22:32,390 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:22:32,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:32,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:32,391 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-17 16:22:32,417 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-17 16:22:32,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:22:32,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:32,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 16:22:32,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:32,659 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 58 treesize of output 34 [2023-11-17 16:22:32,709 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-17 16:22:32,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:32,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:32,763 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 89 treesize of output 49 [2023-11-17 16:22:32,889 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-17 16:22:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741592543] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:32,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:32,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-11-17 16:22:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756212913] [2023-11-17 16:22:32,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:32,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:22:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:32,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:22:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:22:32,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 305 [2023-11-17 16:22:32,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 187 transitions, 2054 flow. Second operand has 22 states, 22 states have (on average 91.77272727272727) internal successors, (2019), 22 states have internal predecessors, (2019), 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-17 16:22:32,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:32,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 305 [2023-11-17 16:22:32,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:33,496 INFO L124 PetriNetUnfolderBase]: 1732/2526 cut-off events. [2023-11-17 16:22:33,496 INFO L125 PetriNetUnfolderBase]: For 13150/13150 co-relation queries the response was YES. [2023-11-17 16:22:33,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13845 conditions, 2526 events. 1732/2526 cut-off events. For 13150/13150 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10613 event pairs, 257 based on Foata normal form. 1/2527 useless extension candidates. Maximal degree in co-relation 13271. Up to 2153 conditions per place. [2023-11-17 16:22:33,513 INFO L140 encePairwiseOnDemand]: 294/305 looper letters, 135 selfloop transitions, 103 changer transitions 1/239 dead transitions. [2023-11-17 16:22:33,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 239 transitions, 2818 flow [2023-11-17 16:22:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:22:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 16:22:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1721 transitions. [2023-11-17 16:22:33,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3134790528233151 [2023-11-17 16:22:33,517 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1721 transitions. [2023-11-17 16:22:33,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1721 transitions. [2023-11-17 16:22:33,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:33,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1721 transitions. [2023-11-17 16:22:33,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 95.61111111111111) internal successors, (1721), 18 states have internal predecessors, (1721), 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-17 16:22:33,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 305.0) internal successors, (5795), 19 states have internal predecessors, (5795), 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-17 16:22:33,525 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 305.0) internal successors, (5795), 19 states have internal predecessors, (5795), 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-17 16:22:33,525 INFO L175 Difference]: Start difference. First operand has 129 places, 187 transitions, 2054 flow. Second operand 18 states and 1721 transitions. [2023-11-17 16:22:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 239 transitions, 2818 flow [2023-11-17 16:22:33,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 239 transitions, 2534 flow, removed 81 selfloop flow, removed 8 redundant places. [2023-11-17 16:22:33,556 INFO L231 Difference]: Finished difference. Result has 140 places, 195 transitions, 2117 flow [2023-11-17 16:22:33,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2117, PETRI_PLACES=140, PETRI_TRANSITIONS=195} [2023-11-17 16:22:33,557 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2023-11-17 16:22:33,557 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 195 transitions, 2117 flow [2023-11-17 16:22:33,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 91.77272727272727) internal successors, (2019), 22 states have internal predecessors, (2019), 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-17 16:22:33,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:33,558 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:33,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-17 16:22:33,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:33,764 INFO L420 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-17 16:22:33,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash -580693628, now seen corresponding path program 7 times [2023-11-17 16:22:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:33,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598952231] [2023-11-17 16:22:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598952231] [2023-11-17 16:22:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598952231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881191952] [2023-11-17 16:22:33,831 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:22:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:33,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:33,846 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-17 16:22:33,851 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-17 16:22:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:33,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:33,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:33,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:34,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881191952] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:34,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:34,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:22:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831144485] [2023-11-17 16:22:34,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:34,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:22:34,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:34,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:22:34,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:22:34,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 305 [2023-11-17 16:22:34,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 195 transitions, 2117 flow. Second operand has 14 states, 14 states have (on average 119.35714285714286) internal successors, (1671), 14 states have internal predecessors, (1671), 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-17 16:22:34,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:34,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 305 [2023-11-17 16:22:34,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:34,495 INFO L124 PetriNetUnfolderBase]: 2136/3112 cut-off events. [2023-11-17 16:22:34,495 INFO L125 PetriNetUnfolderBase]: For 18288/18288 co-relation queries the response was YES. [2023-11-17 16:22:34,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17005 conditions, 3112 events. 2136/3112 cut-off events. For 18288/18288 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13653 event pairs, 647 based on Foata normal form. 52/3164 useless extension candidates. Maximal degree in co-relation 16298. Up to 2258 conditions per place. [2023-11-17 16:22:34,513 INFO L140 encePairwiseOnDemand]: 299/305 looper letters, 224 selfloop transitions, 29 changer transitions 0/253 dead transitions. [2023-11-17 16:22:34,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 253 transitions, 3109 flow [2023-11-17 16:22:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 16:22:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 16:22:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1001 transitions. [2023-11-17 16:22:34,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41024590163934427 [2023-11-17 16:22:34,515 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1001 transitions. [2023-11-17 16:22:34,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1001 transitions. [2023-11-17 16:22:34,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:34,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1001 transitions. [2023-11-17 16:22:34,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.125) internal successors, (1001), 8 states have internal predecessors, (1001), 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-17 16:22:34,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 305.0) internal successors, (2745), 9 states have internal predecessors, (2745), 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-17 16:22:34,519 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 305.0) internal successors, (2745), 9 states have internal predecessors, (2745), 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-17 16:22:34,519 INFO L175 Difference]: Start difference. First operand has 140 places, 195 transitions, 2117 flow. Second operand 8 states and 1001 transitions. [2023-11-17 16:22:34,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 253 transitions, 3109 flow [2023-11-17 16:22:34,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 253 transitions, 2893 flow, removed 43 selfloop flow, removed 14 redundant places. [2023-11-17 16:22:34,553 INFO L231 Difference]: Finished difference. Result has 136 places, 202 transitions, 2116 flow [2023-11-17 16:22:34,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2116, PETRI_PLACES=136, PETRI_TRANSITIONS=202} [2023-11-17 16:22:34,553 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2023-11-17 16:22:34,553 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 202 transitions, 2116 flow [2023-11-17 16:22:34,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 119.35714285714286) internal successors, (1671), 14 states have internal predecessors, (1671), 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-17 16:22:34,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:34,554 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:34,562 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-17 16:22:34,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-17 16:22:34,760 INFO L420 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-17 16:22:34,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2081475549, now seen corresponding path program 8 times [2023-11-17 16:22:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:34,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809069142] [2023-11-17 16:22:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:34,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:34,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809069142] [2023-11-17 16:22:34,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809069142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:34,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048596771] [2023-11-17 16:22:34,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:22:34,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:34,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:34,846 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-17 16:22:34,871 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-17 16:22:34,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:34,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:34,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:34,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:34,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048596771] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:35,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:35,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2023-11-17 16:22:35,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381816204] [2023-11-17 16:22:35,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:35,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:22:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:22:35,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:22:35,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 305 [2023-11-17 16:22:35,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 202 transitions, 2116 flow. Second operand has 19 states, 19 states have (on average 106.63157894736842) internal successors, (2026), 19 states have internal predecessors, (2026), 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-17 16:22:35,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:35,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 305 [2023-11-17 16:22:35,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:35,873 INFO L124 PetriNetUnfolderBase]: 2258/3384 cut-off events. [2023-11-17 16:22:35,873 INFO L125 PetriNetUnfolderBase]: For 24374/24374 co-relation queries the response was YES. [2023-11-17 16:22:35,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18998 conditions, 3384 events. 2258/3384 cut-off events. For 24374/24374 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16197 event pairs, 358 based on Foata normal form. 154/3538 useless extension candidates. Maximal degree in co-relation 18382. Up to 863 conditions per place. [2023-11-17 16:22:35,892 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 329 selfloop transitions, 101 changer transitions 0/430 dead transitions. [2023-11-17 16:22:35,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 430 transitions, 4732 flow [2023-11-17 16:22:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:22:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:22:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2259 transitions. [2023-11-17 16:22:35,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.370327868852459 [2023-11-17 16:22:35,895 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2259 transitions. [2023-11-17 16:22:35,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2259 transitions. [2023-11-17 16:22:35,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:35,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2259 transitions. [2023-11-17 16:22:35,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 112.95) internal successors, (2259), 20 states have internal predecessors, (2259), 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-17 16:22:35,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 305.0) internal successors, (6405), 21 states have internal predecessors, (6405), 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-17 16:22:35,902 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 305.0) internal successors, (6405), 21 states have internal predecessors, (6405), 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-17 16:22:35,903 INFO L175 Difference]: Start difference. First operand has 136 places, 202 transitions, 2116 flow. Second operand 20 states and 2259 transitions. [2023-11-17 16:22:35,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 430 transitions, 4732 flow [2023-11-17 16:22:35,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 430 transitions, 4672 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-17 16:22:35,952 INFO L231 Difference]: Finished difference. Result has 162 places, 227 transitions, 2662 flow [2023-11-17 16:22:35,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2662, PETRI_PLACES=162, PETRI_TRANSITIONS=227} [2023-11-17 16:22:35,952 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2023-11-17 16:22:35,952 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 227 transitions, 2662 flow [2023-11-17 16:22:35,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 106.63157894736842) internal successors, (2026), 19 states have internal predecessors, (2026), 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-17 16:22:35,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:35,953 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:35,958 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-17 16:22:36,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:36,158 INFO L420 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-17 16:22:36,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash -98677720, now seen corresponding path program 9 times [2023-11-17 16:22:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:36,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254382344] [2023-11-17 16:22:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254382344] [2023-11-17 16:22:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254382344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181408551] [2023-11-17 16:22:36,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:22:36,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:36,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:36,246 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-17 16:22:36,281 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-17 16:22:36,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 16:22:36,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:36,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:22:36,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:36,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181408551] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:36,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:36,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:22:36,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339762421] [2023-11-17 16:22:36,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:36,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:22:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:36,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:22:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:22:36,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 305 [2023-11-17 16:22:36,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 227 transitions, 2662 flow. Second operand has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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-17 16:22:36,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:36,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 305 [2023-11-17 16:22:36,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:36,912 INFO L124 PetriNetUnfolderBase]: 1824/2833 cut-off events. [2023-11-17 16:22:36,912 INFO L125 PetriNetUnfolderBase]: For 32552/32552 co-relation queries the response was YES. [2023-11-17 16:22:36,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18667 conditions, 2833 events. 1824/2833 cut-off events. For 32552/32552 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13507 event pairs, 655 based on Foata normal form. 166/2999 useless extension candidates. Maximal degree in co-relation 18570. Up to 1332 conditions per place. [2023-11-17 16:22:36,946 INFO L140 encePairwiseOnDemand]: 299/305 looper letters, 221 selfloop transitions, 27 changer transitions 16/264 dead transitions. [2023-11-17 16:22:36,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 264 transitions, 3502 flow [2023-11-17 16:22:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:22:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:22:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-11-17 16:22:36,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40046838407494145 [2023-11-17 16:22:36,962 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-11-17 16:22:36,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-11-17 16:22:36,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:36,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-11-17 16:22:36,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 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-17 16:22:36,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 305.0) internal successors, (2440), 8 states have internal predecessors, (2440), 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-17 16:22:36,965 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 305.0) internal successors, (2440), 8 states have internal predecessors, (2440), 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-17 16:22:36,965 INFO L175 Difference]: Start difference. First operand has 162 places, 227 transitions, 2662 flow. Second operand 7 states and 855 transitions. [2023-11-17 16:22:36,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 264 transitions, 3502 flow [2023-11-17 16:22:37,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 264 transitions, 3194 flow, removed 103 selfloop flow, removed 6 redundant places. [2023-11-17 16:22:37,052 INFO L231 Difference]: Finished difference. Result has 163 places, 195 transitions, 2224 flow [2023-11-17 16:22:37,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2224, PETRI_PLACES=163, PETRI_TRANSITIONS=195} [2023-11-17 16:22:37,053 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2023-11-17 16:22:37,053 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 195 transitions, 2224 flow [2023-11-17 16:22:37,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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-17 16:22:37,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:37,054 INFO L208 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] [2023-11-17 16:22:37,059 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-17 16:22:37,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 16:22:37,259 INFO L420 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-17 16:22:37,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1907992586, now seen corresponding path program 1 times [2023-11-17 16:22:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957059888] [2023-11-17 16:22:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957059888] [2023-11-17 16:22:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957059888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724509852] [2023-11-17 16:22:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:37,341 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-17 16:22:37,342 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-17 16:22:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:37,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:37,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:37,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:37,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724509852] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:37,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:37,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-17 16:22:37,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303090962] [2023-11-17 16:22:37,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:37,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 16:22:37,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:37,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 16:22:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-17 16:22:37,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 305 [2023-11-17 16:22:37,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 195 transitions, 2224 flow. Second operand has 13 states, 13 states have (on average 114.3076923076923) internal successors, (1486), 13 states have internal predecessors, (1486), 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-17 16:22:37,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:37,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 305 [2023-11-17 16:22:37,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:37,946 INFO L124 PetriNetUnfolderBase]: 1441/2320 cut-off events. [2023-11-17 16:22:37,946 INFO L125 PetriNetUnfolderBase]: For 24758/24758 co-relation queries the response was YES. [2023-11-17 16:22:37,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14719 conditions, 2320 events. 1441/2320 cut-off events. For 24758/24758 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11406 event pairs, 660 based on Foata normal form. 138/2458 useless extension candidates. Maximal degree in co-relation 14375. Up to 1332 conditions per place. [2023-11-17 16:22:37,961 INFO L140 encePairwiseOnDemand]: 299/305 looper letters, 95 selfloop transitions, 3 changer transitions 88/186 dead transitions. [2023-11-17 16:22:37,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 186 transitions, 2433 flow [2023-11-17 16:22:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:22:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:22:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-11-17 16:22:37,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39562841530054643 [2023-11-17 16:22:37,962 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-11-17 16:22:37,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-11-17 16:22:37,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:37,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-11-17 16:22:37,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 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-17 16:22:37,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 305.0) internal successors, (2135), 7 states have internal predecessors, (2135), 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-17 16:22:37,965 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 305.0) internal successors, (2135), 7 states have internal predecessors, (2135), 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-17 16:22:37,965 INFO L175 Difference]: Start difference. First operand has 163 places, 195 transitions, 2224 flow. Second operand 6 states and 724 transitions. [2023-11-17 16:22:37,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 186 transitions, 2433 flow [2023-11-17 16:22:38,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 186 transitions, 2368 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-11-17 16:22:38,024 INFO L231 Difference]: Finished difference. Result has 158 places, 98 transitions, 1127 flow [2023-11-17 16:22:38,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1127, PETRI_PLACES=158, PETRI_TRANSITIONS=98} [2023-11-17 16:22:38,025 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2023-11-17 16:22:38,025 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 98 transitions, 1127 flow [2023-11-17 16:22:38,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 114.3076923076923) internal successors, (1486), 13 states have internal predecessors, (1486), 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-17 16:22:38,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:38,025 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:38,047 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-17 16:22:38,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 16:22:38,245 INFO L420 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-17 16:22:38,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2030812210, now seen corresponding path program 10 times [2023-11-17 16:22:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32665641] [2023-11-17 16:22:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:38,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:38,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32665641] [2023-11-17 16:22:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32665641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:38,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944038322] [2023-11-17 16:22:38,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:22:38,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:38,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:38,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:38,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 16:22:38,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:22:38,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:38,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:38,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:38,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944038322] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:38,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:38,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-11-17 16:22:38,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734773133] [2023-11-17 16:22:38,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:38,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 16:22:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:38,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 16:22:38,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-11-17 16:22:38,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 305 [2023-11-17 16:22:38,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 98 transitions, 1127 flow. Second operand has 17 states, 17 states have (on average 106.58823529411765) internal successors, (1812), 17 states have internal predecessors, (1812), 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-17 16:22:38,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:38,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 305 [2023-11-17 16:22:38,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:39,200 INFO L124 PetriNetUnfolderBase]: 1006/1522 cut-off events. [2023-11-17 16:22:39,200 INFO L125 PetriNetUnfolderBase]: For 20572/20572 co-relation queries the response was YES. [2023-11-17 16:22:39,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11047 conditions, 1522 events. 1006/1522 cut-off events. For 20572/20572 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6088 event pairs, 194 based on Foata normal form. 26/1548 useless extension candidates. Maximal degree in co-relation 10989. Up to 619 conditions per place. [2023-11-17 16:22:39,212 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 130 selfloop transitions, 91 changer transitions 0/221 dead transitions. [2023-11-17 16:22:39,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 221 transitions, 2937 flow [2023-11-17 16:22:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:22:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:22:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2208 transitions. [2023-11-17 16:22:39,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619672131147541 [2023-11-17 16:22:39,215 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2208 transitions. [2023-11-17 16:22:39,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2208 transitions. [2023-11-17 16:22:39,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:39,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2208 transitions. [2023-11-17 16:22:39,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 110.4) internal successors, (2208), 20 states have internal predecessors, (2208), 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-17 16:22:39,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 305.0) internal successors, (6405), 21 states have internal predecessors, (6405), 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-17 16:22:39,222 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 305.0) internal successors, (6405), 21 states have internal predecessors, (6405), 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-17 16:22:39,222 INFO L175 Difference]: Start difference. First operand has 158 places, 98 transitions, 1127 flow. Second operand 20 states and 2208 transitions. [2023-11-17 16:22:39,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 221 transitions, 2937 flow [2023-11-17 16:22:39,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 221 transitions, 2769 flow, removed 67 selfloop flow, removed 12 redundant places. [2023-11-17 16:22:39,256 INFO L231 Difference]: Finished difference. Result has 139 places, 150 transitions, 2089 flow [2023-11-17 16:22:39,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2089, PETRI_PLACES=139, PETRI_TRANSITIONS=150} [2023-11-17 16:22:39,257 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2023-11-17 16:22:39,257 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 150 transitions, 2089 flow [2023-11-17 16:22:39,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 106.58823529411765) internal successors, (1812), 17 states have internal predecessors, (1812), 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-17 16:22:39,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:39,258 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:39,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 16:22:39,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:39,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:39,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1085146458, now seen corresponding path program 11 times [2023-11-17 16:22:39,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:39,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12333243] [2023-11-17 16:22:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:39,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12333243] [2023-11-17 16:22:39,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12333243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:39,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914783915] [2023-11-17 16:22:39,567 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:22:39,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:39,574 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:39,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 16:22:39,676 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:39,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:39,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:39,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:39,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914783915] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:39,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2023-11-17 16:22:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521018026] [2023-11-17 16:22:39,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:39,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:22:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:39,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:22:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:22:39,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 305 [2023-11-17 16:22:39,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 150 transitions, 2089 flow. Second operand has 22 states, 22 states have (on average 106.27272727272727) internal successors, (2338), 22 states have internal predecessors, (2338), 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-17 16:22:39,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:39,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 305 [2023-11-17 16:22:39,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:41,960 INFO L124 PetriNetUnfolderBase]: 3020/4360 cut-off events. [2023-11-17 16:22:41,960 INFO L125 PetriNetUnfolderBase]: For 81130/81130 co-relation queries the response was YES. [2023-11-17 16:22:41,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35773 conditions, 4360 events. 3020/4360 cut-off events. For 81130/81130 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19771 event pairs, 306 based on Foata normal form. 58/4418 useless extension candidates. Maximal degree in co-relation 35711. Up to 1943 conditions per place. [2023-11-17 16:22:41,993 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 443 selfloop transitions, 354 changer transitions 0/797 dead transitions. [2023-11-17 16:22:41,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 797 transitions, 11602 flow [2023-11-17 16:22:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-17 16:22:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-11-17 16:22:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 7775 transitions. [2023-11-17 16:22:42,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36416861826697894 [2023-11-17 16:22:42,007 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 7775 transitions. [2023-11-17 16:22:42,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 7775 transitions. [2023-11-17 16:22:42,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:42,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 7775 transitions. [2023-11-17 16:22:42,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 111.07142857142857) internal successors, (7775), 70 states have internal predecessors, (7775), 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-17 16:22:42,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 305.0) internal successors, (21655), 71 states have internal predecessors, (21655), 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-17 16:22:42,035 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 305.0) internal successors, (21655), 71 states have internal predecessors, (21655), 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-17 16:22:42,035 INFO L175 Difference]: Start difference. First operand has 139 places, 150 transitions, 2089 flow. Second operand 70 states and 7775 transitions. [2023-11-17 16:22:42,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 797 transitions, 11602 flow [2023-11-17 16:22:42,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 797 transitions, 10297 flow, removed 476 selfloop flow, removed 8 redundant places. [2023-11-17 16:22:42,219 INFO L231 Difference]: Finished difference. Result has 243 places, 459 transitions, 7561 flow [2023-11-17 16:22:42,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=7561, PETRI_PLACES=243, PETRI_TRANSITIONS=459} [2023-11-17 16:22:42,219 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 213 predicate places. [2023-11-17 16:22:42,220 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 459 transitions, 7561 flow [2023-11-17 16:22:42,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 106.27272727272727) internal successors, (2338), 22 states have internal predecessors, (2338), 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-17 16:22:42,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:42,220 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:42,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:42,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 16:22:42,425 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:42,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1074718288, now seen corresponding path program 12 times [2023-11-17 16:22:42,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:42,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907477603] [2023-11-17 16:22:42,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:42,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907477603] [2023-11-17 16:22:42,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907477603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:42,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135890336] [2023-11-17 16:22:42,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:22:42,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:42,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:42,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:42,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 16:22:42,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:22:42,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:42,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:22:42,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:42,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:42,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135890336] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:42,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:42,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-17 16:22:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075625849] [2023-11-17 16:22:42,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:42,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:22:42,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:42,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:22:42,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:22:42,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 305 [2023-11-17 16:22:42,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 459 transitions, 7561 flow. Second operand has 18 states, 18 states have (on average 110.27777777777777) internal successors, (1985), 18 states have internal predecessors, (1985), 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-17 16:22:42,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:42,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 305 [2023-11-17 16:22:42,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:43,753 INFO L124 PetriNetUnfolderBase]: 3057/4423 cut-off events. [2023-11-17 16:22:43,753 INFO L125 PetriNetUnfolderBase]: For 147607/147607 co-relation queries the response was YES. [2023-11-17 16:22:43,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44623 conditions, 4423 events. 3057/4423 cut-off events. For 147607/147607 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20190 event pairs, 529 based on Foata normal form. 50/4473 useless extension candidates. Maximal degree in co-relation 44520. Up to 2192 conditions per place. [2023-11-17 16:22:43,802 INFO L140 encePairwiseOnDemand]: 296/305 looper letters, 439 selfloop transitions, 133 changer transitions 0/572 dead transitions. [2023-11-17 16:22:43,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 572 transitions, 10869 flow [2023-11-17 16:22:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:22:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:22:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1153 transitions. [2023-11-17 16:22:43,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3780327868852459 [2023-11-17 16:22:43,803 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1153 transitions. [2023-11-17 16:22:43,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1153 transitions. [2023-11-17 16:22:43,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:43,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1153 transitions. [2023-11-17 16:22:43,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 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-17 16:22:43,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:43,807 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:43,807 INFO L175 Difference]: Start difference. First operand has 243 places, 459 transitions, 7561 flow. Second operand 10 states and 1153 transitions. [2023-11-17 16:22:43,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 572 transitions, 10869 flow [2023-11-17 16:22:44,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 572 transitions, 7977 flow, removed 1364 selfloop flow, removed 9 redundant places. [2023-11-17 16:22:44,490 INFO L231 Difference]: Finished difference. Result has 246 places, 466 transitions, 5912 flow [2023-11-17 16:22:44,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=5391, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5912, PETRI_PLACES=246, PETRI_TRANSITIONS=466} [2023-11-17 16:22:44,497 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2023-11-17 16:22:44,497 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 466 transitions, 5912 flow [2023-11-17 16:22:44,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 110.27777777777777) internal successors, (1985), 18 states have internal predecessors, (1985), 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-17 16:22:44,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:44,497 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:44,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:44,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:44,713 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:44,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1539958718, now seen corresponding path program 13 times [2023-11-17 16:22:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:44,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296642830] [2023-11-17 16:22:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:44,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296642830] [2023-11-17 16:22:44,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296642830] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966129752] [2023-11-17 16:22:44,879 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:22:44,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:44,880 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:44,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-17 16:22:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:44,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:22:44,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:45,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:45,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966129752] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:45,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:45,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-17 16:22:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219252566] [2023-11-17 16:22:45,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:45,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:22:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:45,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:22:45,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:22:45,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 305 [2023-11-17 16:22:45,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 466 transitions, 5912 flow. Second operand has 19 states, 19 states have (on average 110.10526315789474) internal successors, (2092), 19 states have internal predecessors, (2092), 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-17 16:22:45,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:45,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 305 [2023-11-17 16:22:45,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:46,190 INFO L124 PetriNetUnfolderBase]: 3182/4694 cut-off events. [2023-11-17 16:22:46,190 INFO L125 PetriNetUnfolderBase]: For 120479/120479 co-relation queries the response was YES. [2023-11-17 16:22:46,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38819 conditions, 4694 events. 3182/4694 cut-off events. For 120479/120479 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22378 event pairs, 500 based on Foata normal form. 18/4712 useless extension candidates. Maximal degree in co-relation 38717. Up to 2253 conditions per place. [2023-11-17 16:22:46,234 INFO L140 encePairwiseOnDemand]: 296/305 looper letters, 421 selfloop transitions, 132 changer transitions 0/553 dead transitions. [2023-11-17 16:22:46,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 553 transitions, 8511 flow [2023-11-17 16:22:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:22:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:22:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1152 transitions. [2023-11-17 16:22:46,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3777049180327869 [2023-11-17 16:22:46,236 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1152 transitions. [2023-11-17 16:22:46,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1152 transitions. [2023-11-17 16:22:46,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:46,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1152 transitions. [2023-11-17 16:22:46,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.2) internal successors, (1152), 10 states have internal predecessors, (1152), 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-17 16:22:46,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:46,240 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:46,240 INFO L175 Difference]: Start difference. First operand has 246 places, 466 transitions, 5912 flow. Second operand 10 states and 1152 transitions. [2023-11-17 16:22:46,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 553 transitions, 8511 flow [2023-11-17 16:22:46,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 553 transitions, 8245 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-11-17 16:22:46,674 INFO L231 Difference]: Finished difference. Result has 251 places, 474 transitions, 6108 flow [2023-11-17 16:22:46,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=5689, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6108, PETRI_PLACES=251, PETRI_TRANSITIONS=474} [2023-11-17 16:22:46,675 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2023-11-17 16:22:46,675 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 474 transitions, 6108 flow [2023-11-17 16:22:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 110.10526315789474) internal successors, (2092), 19 states have internal predecessors, (2092), 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-17 16:22:46,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:46,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:46,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:46,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-17 16:22:46,881 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:46,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:46,881 INFO L85 PathProgramCache]: Analyzing trace with hash 535924678, now seen corresponding path program 14 times [2023-11-17 16:22:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:46,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087974067] [2023-11-17 16:22:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:46,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:46,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087974067] [2023-11-17 16:22:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087974067] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484726870] [2023-11-17 16:22:46,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:22:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:46,994 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:47,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-17 16:22:47,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:47,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:47,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:22:47,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:47,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:47,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484726870] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:47,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:47,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-17 16:22:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333147769] [2023-11-17 16:22:47,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:47,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:22:47,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:47,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:22:47,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:22:47,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 305 [2023-11-17 16:22:47,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 474 transitions, 6108 flow. Second operand has 21 states, 21 states have (on average 109.9047619047619) internal successors, (2308), 21 states have internal predecessors, (2308), 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-17 16:22:47,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:47,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 305 [2023-11-17 16:22:47,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:48,371 INFO L124 PetriNetUnfolderBase]: 3283/4815 cut-off events. [2023-11-17 16:22:48,371 INFO L125 PetriNetUnfolderBase]: For 116270/116270 co-relation queries the response was YES. [2023-11-17 16:22:48,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39755 conditions, 4815 events. 3283/4815 cut-off events. For 116270/116270 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22648 event pairs, 440 based on Foata normal form. 18/4833 useless extension candidates. Maximal degree in co-relation 39651. Up to 2077 conditions per place. [2023-11-17 16:22:48,419 INFO L140 encePairwiseOnDemand]: 296/305 looper letters, 421 selfloop transitions, 193 changer transitions 0/614 dead transitions. [2023-11-17 16:22:48,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 614 transitions, 9608 flow [2023-11-17 16:22:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 16:22:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-17 16:22:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1978 transitions. [2023-11-17 16:22:48,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814850530376085 [2023-11-17 16:22:48,421 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1978 transitions. [2023-11-17 16:22:48,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1978 transitions. [2023-11-17 16:22:48,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:48,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1978 transitions. [2023-11-17 16:22:48,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 116.3529411764706) internal successors, (1978), 17 states have internal predecessors, (1978), 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-17 16:22:48,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 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-17 16:22:48,426 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 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-17 16:22:48,426 INFO L175 Difference]: Start difference. First operand has 251 places, 474 transitions, 6108 flow. Second operand 17 states and 1978 transitions. [2023-11-17 16:22:48,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 614 transitions, 9608 flow [2023-11-17 16:22:48,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 614 transitions, 9342 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-11-17 16:22:48,852 INFO L231 Difference]: Finished difference. Result has 259 places, 481 transitions, 6358 flow [2023-11-17 16:22:48,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=5780, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6358, PETRI_PLACES=259, PETRI_TRANSITIONS=481} [2023-11-17 16:22:48,852 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2023-11-17 16:22:48,852 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 481 transitions, 6358 flow [2023-11-17 16:22:48,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 109.9047619047619) internal successors, (2308), 21 states have internal predecessors, (2308), 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-17 16:22:48,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:48,853 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:48,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:49,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:49,058 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:49,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 535873524, now seen corresponding path program 15 times [2023-11-17 16:22:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755515496] [2023-11-17 16:22:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755515496] [2023-11-17 16:22:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755515496] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87066710] [2023-11-17 16:22:49,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:22:49,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:49,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:49,185 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:49,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-17 16:22:49,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:22:49,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:49,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:22:49,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:49,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:49,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87066710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:49,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:49,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-17 16:22:49,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181775833] [2023-11-17 16:22:49,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:49,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:22:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:49,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:22:49,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:22:49,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 305 [2023-11-17 16:22:49,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 481 transitions, 6358 flow. Second operand has 19 states, 19 states have (on average 110.10526315789474) internal successors, (2092), 19 states have internal predecessors, (2092), 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-17 16:22:49,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:49,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 305 [2023-11-17 16:22:49,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:50,424 INFO L124 PetriNetUnfolderBase]: 3327/4899 cut-off events. [2023-11-17 16:22:50,424 INFO L125 PetriNetUnfolderBase]: For 121264/121264 co-relation queries the response was YES. [2023-11-17 16:22:50,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41437 conditions, 4899 events. 3327/4899 cut-off events. For 121264/121264 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 23224 event pairs, 901 based on Foata normal form. 54/4953 useless extension candidates. Maximal degree in co-relation 41333. Up to 4068 conditions per place. [2023-11-17 16:22:50,476 INFO L140 encePairwiseOnDemand]: 296/305 looper letters, 440 selfloop transitions, 96 changer transitions 0/536 dead transitions. [2023-11-17 16:22:50,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 536 transitions, 8282 flow [2023-11-17 16:22:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:22:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:22:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1146 transitions. [2023-11-17 16:22:50,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37573770491803277 [2023-11-17 16:22:50,478 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1146 transitions. [2023-11-17 16:22:50,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1146 transitions. [2023-11-17 16:22:50,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:50,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1146 transitions. [2023-11-17 16:22:50,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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-17 16:22:50,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:50,481 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 305.0) internal successors, (3355), 11 states have internal predecessors, (3355), 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-17 16:22:50,481 INFO L175 Difference]: Start difference. First operand has 259 places, 481 transitions, 6358 flow. Second operand 10 states and 1146 transitions. [2023-11-17 16:22:50,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 536 transitions, 8282 flow [2023-11-17 16:22:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 536 transitions, 7927 flow, removed 5 selfloop flow, removed 13 redundant places. [2023-11-17 16:22:51,266 INFO L231 Difference]: Finished difference. Result has 256 places, 486 transitions, 6327 flow [2023-11-17 16:22:51,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=6013, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6327, PETRI_PLACES=256, PETRI_TRANSITIONS=486} [2023-11-17 16:22:51,267 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2023-11-17 16:22:51,267 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 486 transitions, 6327 flow [2023-11-17 16:22:51,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 110.10526315789474) internal successors, (2092), 19 states have internal predecessors, (2092), 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-17 16:22:51,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:51,268 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:51,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:51,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:51,474 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:51,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash -676565176, now seen corresponding path program 16 times [2023-11-17 16:22:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412867994] [2023-11-17 16:22:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412867994] [2023-11-17 16:22:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412867994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180839636] [2023-11-17 16:22:51,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:22:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:51,589 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:51,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-17 16:22:51,701 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:22:51,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:51,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:51,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:51,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180839636] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:51,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:51,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-11-17 16:22:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093469073] [2023-11-17 16:22:51,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:51,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:22:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:22:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:22:51,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 305 [2023-11-17 16:22:51,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 486 transitions, 6327 flow. Second operand has 19 states, 19 states have (on average 106.26315789473684) internal successors, (2019), 19 states have internal predecessors, (2019), 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-17 16:22:51,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:51,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 305 [2023-11-17 16:22:51,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:53,476 INFO L124 PetriNetUnfolderBase]: 3402/5010 cut-off events. [2023-11-17 16:22:53,476 INFO L125 PetriNetUnfolderBase]: For 122571/122571 co-relation queries the response was YES. [2023-11-17 16:22:53,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42302 conditions, 5010 events. 3402/5010 cut-off events. For 122571/122571 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 24088 event pairs, 479 based on Foata normal form. 18/5028 useless extension candidates. Maximal degree in co-relation 42197. Up to 2107 conditions per place. [2023-11-17 16:22:53,559 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 356 selfloop transitions, 359 changer transitions 0/715 dead transitions. [2023-11-17 16:22:53,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 715 transitions, 10873 flow [2023-11-17 16:22:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 16:22:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 16:22:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3199 transitions. [2023-11-17 16:22:53,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36167326172979086 [2023-11-17 16:22:53,578 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3199 transitions. [2023-11-17 16:22:53,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3199 transitions. [2023-11-17 16:22:53,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:53,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3199 transitions. [2023-11-17 16:22:53,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 110.3103448275862) internal successors, (3199), 29 states have internal predecessors, (3199), 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-17 16:22:53,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 305.0) internal successors, (9150), 30 states have internal predecessors, (9150), 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-17 16:22:53,586 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 305.0) internal successors, (9150), 30 states have internal predecessors, (9150), 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-17 16:22:53,586 INFO L175 Difference]: Start difference. First operand has 256 places, 486 transitions, 6327 flow. Second operand 29 states and 3199 transitions. [2023-11-17 16:22:53,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 715 transitions, 10873 flow [2023-11-17 16:22:54,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 715 transitions, 10578 flow, removed 37 selfloop flow, removed 8 redundant places. [2023-11-17 16:22:54,028 INFO L231 Difference]: Finished difference. Result has 280 places, 555 transitions, 8294 flow [2023-11-17 16:22:54,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=6101, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8294, PETRI_PLACES=280, PETRI_TRANSITIONS=555} [2023-11-17 16:22:54,028 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places. [2023-11-17 16:22:54,029 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 555 transitions, 8294 flow [2023-11-17 16:22:54,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 106.26315789473684) internal successors, (2019), 19 states have internal predecessors, (2019), 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-17 16:22:54,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:54,029 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:54,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-17 16:22:54,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:54,234 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:54,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1940238212, now seen corresponding path program 17 times [2023-11-17 16:22:54,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:54,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757686460] [2023-11-17 16:22:54,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:54,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:54,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757686460] [2023-11-17 16:22:54,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757686460] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145829533] [2023-11-17 16:22:54,324 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:22:54,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:54,325 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:54,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-17 16:22:54,417 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:54,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:54,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:54,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:54,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145829533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:54,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-11-17 16:22:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701046497] [2023-11-17 16:22:54,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:22:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:22:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:22:54,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 305 [2023-11-17 16:22:54,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 555 transitions, 8294 flow. Second operand has 18 states, 18 states have (on average 106.33333333333333) internal successors, (1914), 18 states have internal predecessors, (1914), 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-17 16:22:54,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:54,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 305 [2023-11-17 16:22:54,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:56,290 INFO L124 PetriNetUnfolderBase]: 3354/4914 cut-off events. [2023-11-17 16:22:56,291 INFO L125 PetriNetUnfolderBase]: For 133595/133595 co-relation queries the response was YES. [2023-11-17 16:22:56,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43612 conditions, 4914 events. 3354/4914 cut-off events. For 133595/133595 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23245 event pairs, 483 based on Foata normal form. 40/4954 useless extension candidates. Maximal degree in co-relation 43503. Up to 2093 conditions per place. [2023-11-17 16:22:56,337 INFO L140 encePairwiseOnDemand]: 293/305 looper letters, 363 selfloop transitions, 360 changer transitions 0/723 dead transitions. [2023-11-17 16:22:56,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 723 transitions, 11604 flow [2023-11-17 16:22:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-17 16:22:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-17 16:22:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3523 transitions. [2023-11-17 16:22:56,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36096311475409837 [2023-11-17 16:22:56,340 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3523 transitions. [2023-11-17 16:22:56,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3523 transitions. [2023-11-17 16:22:56,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:56,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3523 transitions. [2023-11-17 16:22:56,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 110.09375) internal successors, (3523), 32 states have internal predecessors, (3523), 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-17 16:22:56,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 305.0) internal successors, (10065), 33 states have internal predecessors, (10065), 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-17 16:22:56,348 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 305.0) internal successors, (10065), 33 states have internal predecessors, (10065), 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-17 16:22:56,348 INFO L175 Difference]: Start difference. First operand has 280 places, 555 transitions, 8294 flow. Second operand 32 states and 3523 transitions. [2023-11-17 16:22:56,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 723 transitions, 11604 flow [2023-11-17 16:22:56,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 723 transitions, 10667 flow, removed 340 selfloop flow, removed 13 redundant places. [2023-11-17 16:22:56,990 INFO L231 Difference]: Finished difference. Result has 298 places, 556 transitions, 8160 flow [2023-11-17 16:22:56,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=7190, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=8160, PETRI_PLACES=298, PETRI_TRANSITIONS=556} [2023-11-17 16:22:56,991 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 268 predicate places. [2023-11-17 16:22:56,991 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 556 transitions, 8160 flow [2023-11-17 16:22:56,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 106.33333333333333) internal successors, (1914), 18 states have internal predecessors, (1914), 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-17 16:22:56,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:56,992 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:56,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:57,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:57,197 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:57,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash 119083091, now seen corresponding path program 2 times [2023-11-17 16:22:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:57,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972951158] [2023-11-17 16:22:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:57,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:58,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:58,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972951158] [2023-11-17 16:22:58,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972951158] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:58,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402099588] [2023-11-17 16:22:58,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:22:58,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:58,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:58,101 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:58,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-17 16:22:58,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:58,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:58,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 16:22:58,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:58,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:22:58,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:22:58,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:22:58,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:58,901 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 125 treesize of output 96 [2023-11-17 16:22:59,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:59,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2023-11-17 16:22:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:59,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:02,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse0 (select .cse4 c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (or (< (select .cse0 .cse1) c_~min1~0) (< .cse2 c_~min1~0) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))))) (or (= c_~min1~0 .cse3) (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< .cse2 (+ .cse3 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))) (< c_~min2~0 (+ .cse2 1))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse5 (select .cse7 c_~A~0.base))) (let ((.cse6 (select .cse5 c_~A~0.offset))) (or (< (select .cse5 .cse1) .cse6) (< .cse6 c_~min2~0) (< c_~min1~0 (+ .cse6 1)) (= c_~min2~0 .cse6) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse11 (select .cse10 c_~A~0.base))) (let ((.cse8 (select .cse11 c_~A~0.offset)) (.cse9 (select .cse11 .cse1))) (or (< .cse8 c_~min2~0) (< c_~min1~0 (+ .cse8 1)) (< .cse8 (+ .cse9 1)) (= c_~min2~0 .cse9) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse16 (select .cse15 c_~A~0.base))) (let ((.cse13 (select .cse16 .cse1)) (.cse12 (select .cse16 c_~A~0.offset))) (or (< .cse12 c_~min2~0) (< c_~min1~0 (+ .cse13 1)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))))) (or (= .cse14 .cse13) (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< c_~min2~0 (+ .cse14 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))) (< .cse12 c_~min1~0)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse18 (select .cse20 c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (< .cse17 c_~min2~0) (< (select .cse18 .cse1) c_~min1~0) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))))) (or (= c_~min1~0 .cse19) (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< c_~min2~0 (+ .cse19 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))) (< .cse17 c_~min1~0)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse23 (select .cse22 c_~A~0.base))) (let ((.cse21 (select .cse23 c_~A~0.offset))) (or (= c_~min1~0 .cse21) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) .cse21) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128))) (< (select .cse23 .cse1) c_~min1~0) (< .cse21 c_~min1~0) (< c_~min2~0 (+ .cse21 1))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse28 (select .cse27 c_~A~0.base))) (let ((.cse24 (select .cse28 .cse1)) (.cse25 (select .cse28 c_~A~0.offset))) (or (< c_~min1~0 (+ .cse24 1)) (< .cse25 c_~min1~0) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (let ((.cse26 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))))) (or (= .cse26 .cse24) (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< .cse25 (+ .cse26 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))) (< c_~min2~0 (+ .cse25 1))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse29 (select .cse31 c_~A~0.base))) (let ((.cse30 (select .cse29 c_~A~0.offset))) (or (< (select .cse29 .cse1) .cse30) (< .cse30 c_~min2~0) (< c_~min1~0 (+ .cse30 1)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< c_~min2~0 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse34 (select .cse32 c_~A~0.base))) (let ((.cse33 (select .cse34 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< (select (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) .cse33) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128))) (< c_~min1~0 (+ (select .cse34 .cse1) 1)) (< .cse33 c_~min1~0) (< c_~min2~0 (+ .cse33 1))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse38 (select .cse37 c_~A~0.base))) (let ((.cse35 (select .cse38 c_~A~0.offset)) (.cse36 (select .cse38 .cse1))) (or (< .cse35 c_~min2~0) (< c_~min1~0 (+ .cse36 1)) (< .cse35 c_~min1~0) (= c_~min2~0 .cse36) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< (select (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse40 (select .cse41 c_~A~0.base))) (let ((.cse39 (select .cse40 c_~A~0.offset))) (or (< .cse39 c_~min2~0) (< (select .cse40 .cse1) c_~min1~0) (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< .cse39 c_~min1~0) (< (select (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse47 (select .cse46 c_~A~0.base))) (let ((.cse43 (select .cse47 c_~A~0.offset))) (let ((.cse44 (select .cse47 .cse1)) (.cse42 (+ .cse43 1))) (or (< c_~min1~0 .cse42) (< .cse43 (+ .cse44 1)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (let ((.cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))))) (or (= .cse45 .cse44) (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< .cse43 (+ .cse45 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128)))) (< c_~min2~0 .cse42))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse52 (select .cse51 c_~A~0.base))) (let ((.cse48 (select .cse52 c_~A~0.offset)) (.cse49 (select .cse52 .cse1))) (or (< .cse48 c_~min2~0) (< c_~min1~0 (+ .cse48 1)) (< .cse48 (+ .cse49 1)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (let ((.cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))))) (or (= .cse50 .cse49) (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< c_~min2~0 (+ .cse50 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128))))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse56 (select .cse53 c_~A~0.base))) (let ((.cse54 (select .cse56 c_~A~0.offset))) (let ((.cse55 (+ .cse54 1))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< (select (select (store .cse53 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) .cse54) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128))) (< c_~min1~0 .cse55) (< .cse54 (+ (select .cse56 .cse1) 1)) (< c_~min2~0 .cse55))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse57 (select .cse60 c_~A~0.base))) (let ((.cse58 (select .cse57 c_~A~0.offset))) (let ((.cse59 (+ .cse58 1))) (or (< (select .cse57 .cse1) .cse58) (< c_~min1~0 .cse59) (< c_~min2~0 .cse59) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork0_~i~2_128 Int)) (or (< (+ v_thread3Thread1of1ForFork0_~i~2_128 1) c_~N~0) (< .cse58 (+ (select (select (store .cse60 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork0_~i~2_128 4))) 1)) (< c_~M~0 v_thread3Thread1of1ForFork0_~i~2_128))))))))))) is different from false [2023-11-17 16:23:03,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:03,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 136 [2023-11-17 16:23:03,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:03,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25746 treesize of output 23294 [2023-11-17 16:23:03,755 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 321 treesize of output 265 [2023-11-17 16:23:03,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:03,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 174 [2023-11-17 16:23:03,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:03,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 169 [2023-11-17 16:23:04,755 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:04,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2023-11-17 16:23:04,765 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:04,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 1 [2023-11-17 16:23:04,785 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:04,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2023-11-17 16:23:04,792 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:04,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 1 [2023-11-17 16:23:04,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:04,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 98 [2023-11-17 16:23:04,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:04,813 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-17 16:23:04,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 312 treesize of output 287 [2023-11-17 16:23:04,836 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:23:04,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 296 treesize of output 256 [2023-11-17 16:23:04,854 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:23:04,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 117 [2023-11-17 16:23:04,928 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:04,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 1 [2023-11-17 16:23:04,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:04,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 75 [2023-11-17 16:23:04,938 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:04,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:04,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 509 treesize of output 479 [2023-11-17 16:23:04,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:04,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 117 [2023-11-17 16:23:05,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:05,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 113 [2023-11-17 16:23:05,129 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:05,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 1 [2023-11-17 16:23:05,136 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:05,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 1 [2023-11-17 16:23:05,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:05,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 92 [2023-11-17 16:23:05,147 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:05,160 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-17 16:23:05,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 654 treesize of output 603 [2023-11-17 16:23:05,181 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:23:05,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 122 [2023-11-17 16:23:05,204 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:23:05,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 117 [2023-11-17 16:23:05,222 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:05,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 1 [2023-11-17 16:23:05,230 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:05,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2023-11-17 16:23:05,238 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:05,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2023-11-17 16:23:05,247 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:05,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 1 [2023-11-17 16:23:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:05,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402099588] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:05,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:05,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 40 [2023-11-17 16:23:05,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967377349] [2023-11-17 16:23:05,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:05,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-17 16:23:05,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:05,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-17 16:23:05,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1449, Unknown=21, NotChecked=78, Total=1722 [2023-11-17 16:23:05,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 305 [2023-11-17 16:23:05,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 556 transitions, 8160 flow. Second operand has 42 states, 42 states have (on average 79.71428571428571) internal successors, (3348), 42 states have internal predecessors, (3348), 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-17 16:23:05,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:05,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 305 [2023-11-17 16:23:05,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:11,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:16,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:20,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:23,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:29,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:45,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:49,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:52,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:02,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:14,546 INFO L124 PetriNetUnfolderBase]: 7041/10484 cut-off events. [2023-11-17 16:24:14,546 INFO L125 PetriNetUnfolderBase]: For 296878/296878 co-relation queries the response was YES. [2023-11-17 16:24:14,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96354 conditions, 10484 events. 7041/10484 cut-off events. For 296878/296878 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 59536 event pairs, 438 based on Foata normal form. 9/10493 useless extension candidates. Maximal degree in co-relation 96242. Up to 6520 conditions per place. [2023-11-17 16:24:14,678 INFO L140 encePairwiseOnDemand]: 290/305 looper letters, 1051 selfloop transitions, 798 changer transitions 12/1861 dead transitions. [2023-11-17 16:24:14,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1861 transitions, 29566 flow [2023-11-17 16:24:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-17 16:24:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-11-17 16:24:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 7505 transitions. [2023-11-17 16:24:14,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2828339928396458 [2023-11-17 16:24:14,684 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 7505 transitions. [2023-11-17 16:24:14,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 7505 transitions. [2023-11-17 16:24:14,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:14,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 7505 transitions. [2023-11-17 16:24:14,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 86.26436781609195) internal successors, (7505), 87 states have internal predecessors, (7505), 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-17 16:24:14,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 305.0) internal successors, (26840), 88 states have internal predecessors, (26840), 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-17 16:24:14,707 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 305.0) internal successors, (26840), 88 states have internal predecessors, (26840), 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-17 16:24:14,707 INFO L175 Difference]: Start difference. First operand has 298 places, 556 transitions, 8160 flow. Second operand 87 states and 7505 transitions. [2023-11-17 16:24:14,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1861 transitions, 29566 flow [2023-11-17 16:24:16,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1861 transitions, 27310 flow, removed 238 selfloop flow, removed 27 redundant places. [2023-11-17 16:24:16,608 INFO L231 Difference]: Finished difference. Result has 410 places, 1294 transitions, 22566 flow [2023-11-17 16:24:16,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=7321, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=22566, PETRI_PLACES=410, PETRI_TRANSITIONS=1294} [2023-11-17 16:24:16,609 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 380 predicate places. [2023-11-17 16:24:16,609 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1294 transitions, 22566 flow [2023-11-17 16:24:16,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 79.71428571428571) internal successors, (3348), 42 states have internal predecessors, (3348), 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-17 16:24:16,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:16,723 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:24:16,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-17 16:24:16,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-17 16:24:16,924 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:16,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:16,924 INFO L85 PathProgramCache]: Analyzing trace with hash 843699445, now seen corresponding path program 3 times [2023-11-17 16:24:16,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:16,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448521817] [2023-11-17 16:24:16,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:16,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:18,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448521817] [2023-11-17 16:24:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448521817] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:18,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997675946] [2023-11-17 16:24:18,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:24:18,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:18,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:18,258 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:18,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-17 16:24:18,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 16:24:18,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:18,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 16:24:18,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:19,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:19,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 141 [2023-11-17 16:24:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:20,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:21,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:21,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 401 treesize of output 473 [2023-11-17 16:24:28,210 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:24:32,593 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:24:38,223 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:24:51,847 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:24:58,210 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:25:14,551 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:25:32,028 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:25:44,907 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:26:00,529 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:26:43,448 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:26:51,445 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 16:26:51,447 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 101 [2023-11-17 16:26:51,449 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 16:26:51,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-17 16:26:51,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-17 16:26:51,655 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-17 16:26:51,658 INFO L158 Benchmark]: Toolchain (without parser) took 276073.53ms. Allocated memory was 207.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 157.3MB in the beginning and 353.9MB in the end (delta: -196.6MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-11-17 16:26:51,658 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory was 160.9MB in the beginning and 160.7MB in the end (delta: 134.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:26:51,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.91ms. Allocated memory is still 207.6MB. Free memory was 156.9MB in the beginning and 145.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:26:51,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.36ms. Allocated memory is still 207.6MB. Free memory was 145.0MB in the beginning and 143.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 16:26:51,659 INFO L158 Benchmark]: Boogie Preprocessor took 20.65ms. Allocated memory is still 207.6MB. Free memory was 143.5MB in the beginning and 141.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:26:51,659 INFO L158 Benchmark]: RCFGBuilder took 393.79ms. Allocated memory is still 207.6MB. Free memory was 141.5MB in the beginning and 119.5MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-17 16:26:51,659 INFO L158 Benchmark]: TraceAbstraction took 275421.47ms. Allocated memory was 207.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 118.8MB in the beginning and 353.9MB in the end (delta: -235.0MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-11-17 16:26:51,665 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.12ms. Allocated memory is still 207.6MB. Free memory was 160.9MB in the beginning and 160.7MB in the end (delta: 134.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.91ms. Allocated memory is still 207.6MB. Free memory was 156.9MB in the beginning and 145.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.36ms. Allocated memory is still 207.6MB. Free memory was 145.0MB in the beginning and 143.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.65ms. Allocated memory is still 207.6MB. Free memory was 143.5MB in the beginning and 141.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.79ms. Allocated memory is still 207.6MB. Free memory was 141.5MB in the beginning and 119.5MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 275421.47ms. Allocated memory was 207.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 118.8MB in the beginning and 353.9MB in the end (delta: -235.0MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 143 PlacesBefore, 30 PlacesAfterwards, 145 TransitionsBefore, 24 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 8 FixpointIterations, 83 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 146 TotalNumberOfCompositions, 1847 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1707, independent: 1685, independent conditional: 0, independent unconditional: 1685, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1133, independent: 1121, independent conditional: 0, independent unconditional: 1121, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1133, independent: 1121, independent conditional: 0, independent unconditional: 1121, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1707, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1133, unknown conditional: 0, unknown unconditional: 1133] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...