/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-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:34:11,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:34:11,842 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:34:11,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:34:11,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:34:11,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:34:11,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:34:11,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:34:11,867 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:34:11,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:34:11,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:34:11,867 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:34:11,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:34:11,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:34:11,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:34:11,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:34:11,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:34:11,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:34:11,869 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:34:11,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:34:11,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:34:11,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:34:11,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:34:11,870 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:34:11,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:34:11,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:34:11,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:34:11,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:34:11,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:34:11,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:34:11,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:34:11,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:34:11,872 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:34:12,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:34:12,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:34:12,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:34:12,085 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:34:12,086 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:34:12,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-11-17 16:34:13,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:34:13,305 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:34:13,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-11-17 16:34:13,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d4c4e70/be9f6a19be9346d9abde2a928f7c6e76/FLAG89ddff5d5 [2023-11-17 16:34:13,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d4c4e70/be9f6a19be9346d9abde2a928f7c6e76 [2023-11-17 16:34:13,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:34:13,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:34:13,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:34:13,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:34:13,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:34:13,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0ab501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13, skipping insertion in model container [2023-11-17 16:34:13,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,360 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:34:13,496 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-two-queue.wvr.c[3013,3026] [2023-11-17 16:34:13,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:34:13,514 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:34:13,531 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-two-queue.wvr.c[3013,3026] [2023-11-17 16:34:13,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:34:13,540 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:34:13,540 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:34:13,545 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:34:13,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13 WrapperNode [2023-11-17 16:34:13,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:34:13,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:34:13,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:34:13,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:34:13,552 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:34:13" (1/1) ... [2023-11-17 16:34:13,558 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:34:13" (1/1) ... [2023-11-17 16:34:13,578 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 210 [2023-11-17 16:34:13,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:34:13,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:34:13,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:34:13,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:34:13,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:34:13,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:34:13,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:34:13,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:34:13,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (1/1) ... [2023-11-17 16:34:13,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:34:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:34:13,648 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:34:13,650 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:34:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:34:13,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:34:13,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:34:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:34:13,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:34:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:34:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:34:13,673 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:34:13,761 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:34:13,763 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:34:14,006 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:34:14,126 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:34:14,127 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:34:14,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:34:14 BoogieIcfgContainer [2023-11-17 16:34:14,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:34:14,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:34:14,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:34:14,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:34:14,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:34:13" (1/3) ... [2023-11-17 16:34:14,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50de2d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:34:14, skipping insertion in model container [2023-11-17 16:34:14,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:34:13" (2/3) ... [2023-11-17 16:34:14,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50de2d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:34:14, skipping insertion in model container [2023-11-17 16:34:14,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:34:14" (3/3) ... [2023-11-17 16:34:14,134 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-11-17 16:34:14,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:34:14,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:34:14,146 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:34:14,192 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 16:34:14,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 185 transitions, 384 flow [2023-11-17 16:34:14,294 INFO L124 PetriNetUnfolderBase]: 13/183 cut-off events. [2023-11-17 16:34:14,294 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:34:14,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 13/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2023-11-17 16:34:14,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 185 transitions, 384 flow [2023-11-17 16:34:14,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 174 transitions, 360 flow [2023-11-17 16:34:14,303 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:34:14,311 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 174 transitions, 360 flow [2023-11-17 16:34:14,314 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 174 transitions, 360 flow [2023-11-17 16:34:14,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 174 transitions, 360 flow [2023-11-17 16:34:14,346 INFO L124 PetriNetUnfolderBase]: 13/174 cut-off events. [2023-11-17 16:34:14,347 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:34:14,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 13/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2023-11-17 16:34:14,349 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-11-17 16:34:18,904 INFO L134 LiptonReduction]: Checked pairs total: 920 [2023-11-17 16:34:18,904 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-11-17 16:34:18,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:34:18,920 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;@22bc6b7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:34:18,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 16:34:18,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:34:18,923 INFO L124 PetriNetUnfolderBase]: 4/20 cut-off events. [2023-11-17 16:34:18,923 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:34:18,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:18,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:34:18,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:18,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:18,928 INFO L85 PathProgramCache]: Analyzing trace with hash 583909980, now seen corresponding path program 1 times [2023-11-17 16:34:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:18,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874942644] [2023-11-17 16:34:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:19,186 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:34:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:19,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874942644] [2023-11-17 16:34:19,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874942644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:34:19,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:34:19,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:34:19,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293302523] [2023-11-17 16:34:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:34:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:34:19,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:19,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:34:19,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:34:19,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 371 [2023-11-17 16:34:19,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:34:19,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:19,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 371 [2023-11-17 16:34:19,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:19,301 INFO L124 PetriNetUnfolderBase]: 115/199 cut-off events. [2023-11-17 16:34:19,301 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 16:34:19,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 199 events. 115/199 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 711 event pairs, 24 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 328. Up to 136 conditions per place. [2023-11-17 16:34:19,306 INFO L140 encePairwiseOnDemand]: 367/371 looper letters, 27 selfloop transitions, 3 changer transitions 1/33 dead transitions. [2023-11-17 16:34:19,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 33 transitions, 149 flow [2023-11-17 16:34:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:34:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:34:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2023-11-17 16:34:19,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44923629829290207 [2023-11-17 16:34:19,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2023-11-17 16:34:19,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2023-11-17 16:34:19,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:19,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2023-11-17 16:34:19,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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:34:19,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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:34:19,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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:34:19,342 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 54 flow. Second operand 3 states and 500 transitions. [2023-11-17 16:34:19,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 33 transitions, 149 flow [2023-11-17 16:34:19,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 33 transitions, 135 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 16:34:19,347 INFO L231 Difference]: Finished difference. Result has 23 places, 23 transitions, 65 flow [2023-11-17 16:34:19,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=23, PETRI_TRANSITIONS=23} [2023-11-17 16:34:19,351 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 16:34:19,351 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 23 transitions, 65 flow [2023-11-17 16:34:19,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:34:19,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:19,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:34:19,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:34:19,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:19,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash 315487462, now seen corresponding path program 1 times [2023-11-17 16:34:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850592907] [2023-11-17 16:34:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:19,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850592907] [2023-11-17 16:34:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850592907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:34:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:34:19,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:34:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099808528] [2023-11-17 16:34:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:34:19,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:34:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:34:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:34:19,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 371 [2023-11-17 16:34:19,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 23 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:34:19,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:19,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 371 [2023-11-17 16:34:19,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:19,519 INFO L124 PetriNetUnfolderBase]: 84/154 cut-off events. [2023-11-17 16:34:19,520 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-17 16:34:19,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 154 events. 84/154 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 486 event pairs, 17 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 126. Up to 108 conditions per place. [2023-11-17 16:34:19,521 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 25 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-11-17 16:34:19,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 141 flow [2023-11-17 16:34:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:34:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:34:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2023-11-17 16:34:19,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46451033243486073 [2023-11-17 16:34:19,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2023-11-17 16:34:19,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2023-11-17 16:34:19,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:19,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2023-11-17 16:34:19,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 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:34:19,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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:34:19,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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:34:19,526 INFO L175 Difference]: Start difference. First operand has 23 places, 23 transitions, 65 flow. Second operand 3 states and 517 transitions. [2023-11-17 16:34:19,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 141 flow [2023-11-17 16:34:19,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:34:19,527 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 74 flow [2023-11-17 16:34:19,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2023-11-17 16:34:19,528 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2023-11-17 16:34:19,528 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 74 flow [2023-11-17 16:34:19,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:34:19,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:19,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:34:19,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:34:19,529 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:19,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash 126345630, now seen corresponding path program 1 times [2023-11-17 16:34:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959706518] [2023-11-17 16:34:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:19,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959706518] [2023-11-17 16:34:19,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959706518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:34:19,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:34:19,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:34:19,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30887349] [2023-11-17 16:34:19,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:34:19,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:34:19,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:19,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:34:19,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:34:19,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 371 [2023-11-17 16:34:19,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:34:19,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:19,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 371 [2023-11-17 16:34:19,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:19,672 INFO L124 PetriNetUnfolderBase]: 63/126 cut-off events. [2023-11-17 16:34:19,672 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 16:34:19,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 126 events. 63/126 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 363 event pairs, 21 based on Foata normal form. 6/111 useless extension candidates. Maximal degree in co-relation 168. Up to 81 conditions per place. [2023-11-17 16:34:19,675 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 25 selfloop transitions, 2 changer transitions 5/34 dead transitions. [2023-11-17 16:34:19,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 164 flow [2023-11-17 16:34:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:34:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:34:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2023-11-17 16:34:19,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2023-11-17 16:34:19,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2023-11-17 16:34:19,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2023-11-17 16:34:19,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:19,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2023-11-17 16:34:19,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 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:34:19,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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:34:19,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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:34:19,682 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 74 flow. Second operand 3 states and 519 transitions. [2023-11-17 16:34:19,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 164 flow [2023-11-17 16:34:19,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:34:19,684 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 84 flow [2023-11-17 16:34:19,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=72, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2023-11-17 16:34:19,685 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-11-17 16:34:19,685 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 84 flow [2023-11-17 16:34:19,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:34:19,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:19,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:34:19,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:34:19,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:19,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1758898186, now seen corresponding path program 1 times [2023-11-17 16:34:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313032130] [2023-11-17 16:34:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:19,829 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:34:19,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313032130] [2023-11-17 16:34:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313032130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:34:19,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:34:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:34:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382900781] [2023-11-17 16:34:19,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:34:19,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:34:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:19,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:34:19,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:34:19,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 371 [2023-11-17 16:34:19,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:34:19,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:19,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 371 [2023-11-17 16:34:19,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:19,896 INFO L124 PetriNetUnfolderBase]: 79/173 cut-off events. [2023-11-17 16:34:19,896 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-17 16:34:19,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 173 events. 79/173 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 657 event pairs, 54 based on Foata normal form. 5/169 useless extension candidates. Maximal degree in co-relation 254. Up to 124 conditions per place. [2023-11-17 16:34:19,897 INFO L140 encePairwiseOnDemand]: 367/371 looper letters, 22 selfloop transitions, 2 changer transitions 13/39 dead transitions. [2023-11-17 16:34:19,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 193 flow [2023-11-17 16:34:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:34:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:34:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-11-17 16:34:19,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3948787061994609 [2023-11-17 16:34:19,899 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-11-17 16:34:19,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-11-17 16:34:19,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:19,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-11-17 16:34:19,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 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:34:19,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 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:34:19,904 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 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:34:19,904 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 84 flow. Second operand 4 states and 586 transitions. [2023-11-17 16:34:19,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 193 flow [2023-11-17 16:34:19,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:34:19,906 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 96 flow [2023-11-17 16:34:19,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-11-17 16:34:19,907 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-11-17 16:34:19,907 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 96 flow [2023-11-17 16:34:19,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:34:19,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:19,908 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:34:19,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:34:19,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:19,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1747428269, now seen corresponding path program 1 times [2023-11-17 16:34:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462308101] [2023-11-17 16:34:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:34:19,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:19,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462308101] [2023-11-17 16:34:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462308101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:34:19,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:34:19,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:34:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422463845] [2023-11-17 16:34:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:34:19,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:34:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:19,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:34:19,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:34:19,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 371 [2023-11-17 16:34:19,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 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:34:19,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:19,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 371 [2023-11-17 16:34:19,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:20,048 INFO L124 PetriNetUnfolderBase]: 78/171 cut-off events. [2023-11-17 16:34:20,050 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-11-17 16:34:20,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 171 events. 78/171 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 649 event pairs, 54 based on Foata normal form. 7/170 useless extension candidates. Maximal degree in co-relation 413. Up to 125 conditions per place. [2023-11-17 16:34:20,053 INFO L140 encePairwiseOnDemand]: 367/371 looper letters, 23 selfloop transitions, 2 changer transitions 11/38 dead transitions. [2023-11-17 16:34:20,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 200 flow [2023-11-17 16:34:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:34:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:34:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2023-11-17 16:34:20,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935309973045822 [2023-11-17 16:34:20,055 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2023-11-17 16:34:20,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2023-11-17 16:34:20,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:20,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2023-11-17 16:34:20,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:34:20,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 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:34:20,060 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 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:34:20,060 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 96 flow. Second operand 4 states and 584 transitions. [2023-11-17 16:34:20,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 200 flow [2023-11-17 16:34:20,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 192 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 16:34:20,063 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 104 flow [2023-11-17 16:34:20,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-11-17 16:34:20,066 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2023-11-17 16:34:20,066 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 104 flow [2023-11-17 16:34:20,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 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:34:20,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:20,067 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:34:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 16:34:20,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:20,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1048826390, now seen corresponding path program 1 times [2023-11-17 16:34:20,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:20,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022371062] [2023-11-17 16:34:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022371062] [2023-11-17 16:34:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022371062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:34:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5112321] [2023-11-17 16:34:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:21,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:34:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:34:21,458 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:34:21,477 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:34:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:21,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 16:34:21,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:34:21,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 16:34:21,835 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:34:21,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:34:21,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-17 16:34:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:22,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:34:23,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:23,032 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 118 treesize of output 82 [2023-11-17 16:34:23,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:23,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 459 [2023-11-17 16:34:23,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:23,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 208 [2023-11-17 16:34:23,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:23,154 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 152 treesize of output 156 [2023-11-17 16:34:38,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:38,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 144 treesize of output 96 [2023-11-17 16:34:38,820 INFO L349 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2023-11-17 16:34:38,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 609 treesize of output 567 [2023-11-17 16:34:38,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:34:38,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:38,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 466 treesize of output 440 [2023-11-17 16:34:38,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:34:38,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:38,913 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 413 treesize of output 309 [2023-11-17 16:34:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:41,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5112321] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:34:41,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:34:41,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-11-17 16:34:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835046297] [2023-11-17 16:34:41,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:34:41,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-17 16:34:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:41,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-17 16:34:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1070, Unknown=2, NotChecked=0, Total=1190 [2023-11-17 16:34:41,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 371 [2023-11-17 16:34:41,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 104 flow. Second operand has 35 states, 35 states have (on average 92.51428571428572) internal successors, (3238), 35 states have internal predecessors, (3238), 0 states have call successors, (0), 0 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:34:41,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:41,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 371 [2023-11-17 16:34:41,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:42,433 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~j~0 c_~i~0) (or (< c_~q2_back~0 0) (< c_~n1~0 (+ c_~q1_back~0 1)) (let ((.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~i~0) (not (= c_~j~0 (select .cse2 .cse3))) (< (select .cse2 .cse4) (+ c_~i~0 1)))))) (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse5 (select (select .cse7 c_~q2~0.base) .cse1)) (.cse6 (select .cse7 ~q1~0.base))) (or (< .cse5 c_~i~0) (not (= c_~j~0 (select .cse6 .cse3))) (< .cse5 (+ (select .cse6 .cse4) 1)))))))) (< c_~q1_back~0 0) (< c_~n2~0 (+ c_~q2_back~0 1)) (< c_~n2~0 (+ c_~q2_front~0 1)) (< c_~q2_front~0 0) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))) is different from false [2023-11-17 16:34:42,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~j~0 c_~i~0)) (.cse0 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse2 (< c_~q1_back~0 0)) (.cse11 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse12 (< c_~q2_front~0 0)) (.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (or (not (= c_~q2_front~0 0)) .cse0 (and .cse1 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 (not (= c_~q2_back~0 0))) (or (= c_~j~0 (+ (select (select |c_#memory_int| c_~q1~0.base) .cse3) 1)) (< c_~j~0 c_~N~0)) .cse1 (or (< c_~q2_back~0 0) .cse0 (and (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse6 (select .cse4 ~q1~0.base))) (or (< (select (select .cse4 c_~q2~0.base) .cse5) c_~i~0) (not (= c_~j~0 (select .cse6 .cse7))) (< (select .cse6 .cse3) (+ c_~i~0 1)))))) (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse8 (select (select .cse10 c_~q2~0.base) .cse5)) (.cse9 (select .cse10 ~q1~0.base))) (or (< .cse8 c_~i~0) (not (= c_~j~0 (select .cse9 .cse7))) (< .cse8 (+ (select .cse9 .cse3) 1))))))) .cse2 (< c_~n2~0 (+ c_~q2_back~0 1)) .cse11 .cse12 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or .cse0 .cse2 .cse11 .cse12 (and (forall ((v_ArrVal_97 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (or (< (+ (select (select .cse13 c_~q2~0.base) .cse5) 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse14 (select .cse13 ~q1~0.base))) (or (< (select .cse14 .cse3) c_~N~0) (not (= c_~j~0 (select .cse14 .cse7))))))))) (forall ((v_ArrVal_97 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse15 (select (select .cse17 c_~q2~0.base) .cse5))) (or (< (+ .cse15 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse16 (select .cse17 ~q1~0.base))) (or (not (= c_~j~0 (select .cse16 .cse7))) (< .cse15 (+ (select .cse16 .cse3) 1))))))))))))) is different from false [2023-11-17 16:34:42,724 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse1 (< c_~q1_back~0 0)) (.cse10 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse11 (< c_~q2_front~0 0)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (or (not (= c_~q2_front~0 0)) .cse0 (and (= c_~j~0 c_~i~0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (not (= c_~q2_back~0 0))) (or (< c_~q2_back~0 0) .cse0 (and (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 c_~q2~0.base) .cse3) c_~i~0) (not (= c_~j~0 (select .cse4 .cse5))) (< (select .cse4 .cse6) (+ c_~i~0 1)))))) (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse7 (select (select .cse9 c_~q2~0.base) .cse3)) (.cse8 (select .cse9 ~q1~0.base))) (or (< .cse7 c_~i~0) (not (= c_~j~0 (select .cse8 .cse5))) (< .cse7 (+ (select .cse8 .cse6) 1))))))) .cse1 (< c_~n2~0 (+ c_~q2_back~0 1)) .cse10 .cse11 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or .cse0 .cse1 .cse10 .cse11 (and (forall ((v_ArrVal_97 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (or (< (+ (select (select .cse12 c_~q2~0.base) .cse3) 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse13 (select .cse12 ~q1~0.base))) (or (< (select .cse13 .cse6) c_~N~0) (not (= c_~j~0 (select .cse13 .cse5))))))))) (forall ((v_ArrVal_97 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse14 (select (select .cse16 c_~q2~0.base) .cse3))) (or (< (+ .cse14 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse15 (select .cse16 ~q1~0.base))) (or (not (= c_~j~0 (select .cse15 .cse5))) (< .cse14 (+ (select .cse15 .cse6) 1))))))))))))) is different from false [2023-11-17 16:34:47,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse1 (< c_~q1_back~0 0)) (.cse10 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse11 (< c_~q2_front~0 0)) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (or (not (= c_~q2_front~0 0)) .cse0 (and (= c_~j~0 c_~i~0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (not (= c_~q2_back~0 0))) (= c_~j~0 (+ (select (select |c_#memory_int| c_~q1~0.base) .cse2) 1)) (or (< c_~q2_back~0 0) .cse0 (and (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse5 (select .cse3 ~q1~0.base))) (or (< (select (select .cse3 c_~q2~0.base) .cse4) c_~i~0) (not (= c_~j~0 (select .cse5 .cse6))) (< (select .cse5 .cse2) (+ c_~i~0 1)))))) (forall ((~q1~0.base Int) (v_ArrVal_97 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse7 (select (select .cse9 c_~q2~0.base) .cse4)) (.cse8 (select .cse9 ~q1~0.base))) (or (< .cse7 c_~i~0) (not (= c_~j~0 (select .cse8 .cse6))) (< .cse7 (+ (select .cse8 .cse2) 1))))))) .cse1 (< c_~n2~0 (+ c_~q2_back~0 1)) .cse10 .cse11 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (= c_~j~0 1) (or .cse0 .cse1 .cse10 .cse11 (and (forall ((v_ArrVal_97 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (or (< (+ (select (select .cse12 c_~q2~0.base) .cse4) 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse13 (select .cse12 ~q1~0.base))) (or (< (select .cse13 .cse2) c_~N~0) (not (= c_~j~0 (select .cse13 .cse6))))))))) (forall ((v_ArrVal_97 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_97))) (let ((.cse14 (select (select .cse16 c_~q2~0.base) .cse4))) (or (< (+ .cse14 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse15 (select .cse16 ~q1~0.base))) (or (not (= c_~j~0 (select .cse15 .cse6))) (< .cse14 (+ (select .cse15 .cse2) 1))))))))))) (= c_~i~0 1))) is different from false [2023-11-17 16:34:47,637 INFO L124 PetriNetUnfolderBase]: 374/753 cut-off events. [2023-11-17 16:34:47,637 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-17 16:34:47,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 753 events. 374/753 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3821 event pairs, 36 based on Foata normal form. 6/748 useless extension candidates. Maximal degree in co-relation 1281. Up to 168 conditions per place. [2023-11-17 16:34:47,641 INFO L140 encePairwiseOnDemand]: 356/371 looper letters, 102 selfloop transitions, 122 changer transitions 34/260 dead transitions. [2023-11-17 16:34:47,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 260 transitions, 1379 flow [2023-11-17 16:34:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-17 16:34:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-17 16:34:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 5165 transitions. [2023-11-17 16:34:47,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.257811720075871 [2023-11-17 16:34:47,665 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 5165 transitions. [2023-11-17 16:34:47,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 5165 transitions. [2023-11-17 16:34:47,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:47,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 5165 transitions. [2023-11-17 16:34:47,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 95.64814814814815) internal successors, (5165), 54 states have internal predecessors, (5165), 0 states have call successors, (0), 0 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:34:47,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 371.0) internal successors, (20405), 55 states have internal predecessors, (20405), 0 states have call successors, (0), 0 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:34:47,702 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 371.0) internal successors, (20405), 55 states have internal predecessors, (20405), 0 states have call successors, (0), 0 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:34:47,702 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 104 flow. Second operand 54 states and 5165 transitions. [2023-11-17 16:34:47,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 260 transitions, 1379 flow [2023-11-17 16:34:47,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 260 transitions, 1348 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-11-17 16:34:47,713 INFO L231 Difference]: Finished difference. Result has 100 places, 145 transitions, 965 flow [2023-11-17 16:34:47,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=965, PETRI_PLACES=100, PETRI_TRANSITIONS=145} [2023-11-17 16:34:47,714 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 76 predicate places. [2023-11-17 16:34:47,714 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 145 transitions, 965 flow [2023-11-17 16:34:47,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 92.51428571428572) internal successors, (3238), 35 states have internal predecessors, (3238), 0 states have call successors, (0), 0 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:34:47,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:47,715 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:34:47,726 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:34:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 16:34:47,925 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:47,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:47,926 INFO L85 PathProgramCache]: Analyzing trace with hash 941983946, now seen corresponding path program 2 times [2023-11-17 16:34:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735275772] [2023-11-17 16:34:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:49,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735275772] [2023-11-17 16:34:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735275772] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:34:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003969037] [2023-11-17 16:34:49,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:34:49,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:34:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:34:49,156 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:34:49,158 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:34:49,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:34:49,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:34:49,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-17 16:34:49,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:34:49,549 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-17 16:34:49,550 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 54 treesize of output 22 [2023-11-17 16:34:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:34:49,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:34:49,882 INFO L349 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-11-17 16:34:49,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 226 [2023-11-17 16:34:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:34:51,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003969037] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:34:51,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:34:51,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 27 [2023-11-17 16:34:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370625748] [2023-11-17 16:34:51,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:34:51,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 16:34:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 16:34:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2023-11-17 16:34:51,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 371 [2023-11-17 16:34:51,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 145 transitions, 965 flow. Second operand has 29 states, 29 states have (on average 101.89655172413794) internal successors, (2955), 29 states have internal predecessors, (2955), 0 states have call successors, (0), 0 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:34:51,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:51,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 371 [2023-11-17 16:34:51,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:54,208 INFO L124 PetriNetUnfolderBase]: 585/1174 cut-off events. [2023-11-17 16:34:54,209 INFO L125 PetriNetUnfolderBase]: For 5888/5892 co-relation queries the response was YES. [2023-11-17 16:34:54,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5437 conditions, 1174 events. 585/1174 cut-off events. For 5888/5892 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6791 event pairs, 93 based on Foata normal form. 6/1173 useless extension candidates. Maximal degree in co-relation 4937. Up to 493 conditions per place. [2023-11-17 16:34:54,215 INFO L140 encePairwiseOnDemand]: 358/371 looper letters, 156 selfloop transitions, 136 changer transitions 29/323 dead transitions. [2023-11-17 16:34:54,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 323 transitions, 2720 flow [2023-11-17 16:34:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-17 16:34:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-17 16:34:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3782 transitions. [2023-11-17 16:34:54,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2831686133572926 [2023-11-17 16:34:54,224 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3782 transitions. [2023-11-17 16:34:54,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3782 transitions. [2023-11-17 16:34:54,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:54,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3782 transitions. [2023-11-17 16:34:54,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 105.05555555555556) internal successors, (3782), 36 states have internal predecessors, (3782), 0 states have call successors, (0), 0 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:34:54,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 371.0) internal successors, (13727), 37 states have internal predecessors, (13727), 0 states have call successors, (0), 0 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:34:54,244 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 371.0) internal successors, (13727), 37 states have internal predecessors, (13727), 0 states have call successors, (0), 0 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:34:54,244 INFO L175 Difference]: Start difference. First operand has 100 places, 145 transitions, 965 flow. Second operand 36 states and 3782 transitions. [2023-11-17 16:34:54,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 323 transitions, 2720 flow [2023-11-17 16:34:54,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 323 transitions, 2488 flow, removed 114 selfloop flow, removed 2 redundant places. [2023-11-17 16:34:54,275 INFO L231 Difference]: Finished difference. Result has 142 places, 224 transitions, 1742 flow [2023-11-17 16:34:54,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1742, PETRI_PLACES=142, PETRI_TRANSITIONS=224} [2023-11-17 16:34:54,276 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 118 predicate places. [2023-11-17 16:34:54,276 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 224 transitions, 1742 flow [2023-11-17 16:34:54,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 101.89655172413794) internal successors, (2955), 29 states have internal predecessors, (2955), 0 states have call successors, (0), 0 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:34:54,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:54,277 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:34:54,284 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:34:54,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-17 16:34:54,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:34:54,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2120354784, now seen corresponding path program 3 times [2023-11-17 16:34:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995971850] [2023-11-17 16:34:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:55,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995971850] [2023-11-17 16:34:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995971850] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:34:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269891858] [2023-11-17 16:34:55,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:34:55,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:34:55,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:34:55,480 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:34:55,482 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:34:55,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 16:34:55,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:34:55,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-17 16:34:55,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:34:55,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 16:34:55,770 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:34:55,817 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:34:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:34:56,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:34:56,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:56,786 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 147 treesize of output 99 [2023-11-17 16:34:56,843 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-11-17 16:34:56,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 649 treesize of output 649 [2023-11-17 16:34:56,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:56,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 537 treesize of output 485 [2023-11-17 16:34:56,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:34:56,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 380 treesize of output 394 [2023-11-17 16:35:30,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:35:30,522 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 121 treesize of output 85 [2023-11-17 16:35:30,548 INFO L349 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-11-17 16:35:30,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 278 [2023-11-17 16:35:30,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:35:30,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:35:30,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:35:30,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 255 treesize of output 223 [2023-11-17 16:35:30,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:35:30,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:35:30,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:35:30,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 161 treesize of output 153 [2023-11-17 16:35:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:35:30,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269891858] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:35:30,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:35:30,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-11-17 16:35:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677937437] [2023-11-17 16:35:30,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:35:30,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:35:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:35:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:35:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=926, Unknown=1, NotChecked=0, Total=1056 [2023-11-17 16:35:30,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 371 [2023-11-17 16:35:30,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 224 transitions, 1742 flow. Second operand has 33 states, 33 states have (on average 92.60606060606061) internal successors, (3056), 33 states have internal predecessors, (3056), 0 states have call successors, (0), 0 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:35:30,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:35:30,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 371 [2023-11-17 16:35:30,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:35:35,871 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:35:36,816 INFO L124 PetriNetUnfolderBase]: 906/1784 cut-off events. [2023-11-17 16:35:36,816 INFO L125 PetriNetUnfolderBase]: For 15968/15972 co-relation queries the response was YES. [2023-11-17 16:35:36,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9800 conditions, 1784 events. 906/1784 cut-off events. For 15968/15972 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11157 event pairs, 116 based on Foata normal form. 16/1785 useless extension candidates. Maximal degree in co-relation 9319. Up to 471 conditions per place. [2023-11-17 16:35:36,830 INFO L140 encePairwiseOnDemand]: 359/371 looper letters, 177 selfloop transitions, 260 changer transitions 22/461 dead transitions. [2023-11-17 16:35:36,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 461 transitions, 4596 flow [2023-11-17 16:35:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 16:35:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-17 16:35:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4236 transitions. [2023-11-17 16:35:36,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25949522175937273 [2023-11-17 16:35:36,838 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4236 transitions. [2023-11-17 16:35:36,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4236 transitions. [2023-11-17 16:35:36,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:35:36,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4236 transitions. [2023-11-17 16:35:36,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 96.27272727272727) internal successors, (4236), 44 states have internal predecessors, (4236), 0 states have call successors, (0), 0 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:35:36,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 371.0) internal successors, (16695), 45 states have internal predecessors, (16695), 0 states have call successors, (0), 0 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:35:36,867 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 371.0) internal successors, (16695), 45 states have internal predecessors, (16695), 0 states have call successors, (0), 0 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:35:36,867 INFO L175 Difference]: Start difference. First operand has 142 places, 224 transitions, 1742 flow. Second operand 44 states and 4236 transitions. [2023-11-17 16:35:36,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 461 transitions, 4596 flow [2023-11-17 16:35:36,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 461 transitions, 4398 flow, removed 90 selfloop flow, removed 7 redundant places. [2023-11-17 16:35:36,919 INFO L231 Difference]: Finished difference. Result has 194 places, 341 transitions, 3530 flow [2023-11-17 16:35:36,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=3530, PETRI_PLACES=194, PETRI_TRANSITIONS=341} [2023-11-17 16:35:36,921 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 170 predicate places. [2023-11-17 16:35:36,921 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 341 transitions, 3530 flow [2023-11-17 16:35:36,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 92.60606060606061) internal successors, (3056), 33 states have internal predecessors, (3056), 0 states have call successors, (0), 0 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:35:36,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:35:36,922 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:35:36,951 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:35:37,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:35:37,128 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:35:37,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:35:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1224849278, now seen corresponding path program 4 times [2023-11-17 16:35:37,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:35:37,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54340971] [2023-11-17 16:35:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:35:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:35:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:35:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:35:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54340971] [2023-11-17 16:35:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54340971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:35:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051088744] [2023-11-17 16:35:38,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:35:38,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:35:38,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:35:38,144 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:35:38,146 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:35:38,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:35:38,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:35:38,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 16:35:38,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:35:38,660 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:35:38,661 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 42 treesize of output 22 [2023-11-17 16:35:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:38,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:35:39,038 INFO L349 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-11-17 16:35:39,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 224 [2023-11-17 16:35:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051088744] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:35:41,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:35:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-11-17 16:35:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813739498] [2023-11-17 16:35:41,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:35:41,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:35:41,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:35:41,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:35:41,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2023-11-17 16:35:41,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 371 [2023-11-17 16:35:41,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 341 transitions, 3530 flow. Second operand has 33 states, 33 states have (on average 101.60606060606061) internal successors, (3353), 33 states have internal predecessors, (3353), 0 states have call successors, (0), 0 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:35:41,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:35:41,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 371 [2023-11-17 16:35:41,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:35:44,896 INFO L124 PetriNetUnfolderBase]: 1033/2039 cut-off events. [2023-11-17 16:35:44,897 INFO L125 PetriNetUnfolderBase]: For 34396/34400 co-relation queries the response was YES. [2023-11-17 16:35:44,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13787 conditions, 2039 events. 1033/2039 cut-off events. For 34396/34400 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13139 event pairs, 135 based on Foata normal form. 3/2036 useless extension candidates. Maximal degree in co-relation 13382. Up to 855 conditions per place. [2023-11-17 16:35:44,918 INFO L140 encePairwiseOnDemand]: 358/371 looper letters, 173 selfloop transitions, 299 changer transitions 26/500 dead transitions. [2023-11-17 16:35:44,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 500 transitions, 5939 flow [2023-11-17 16:35:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-17 16:35:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-17 16:35:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4625 transitions. [2023-11-17 16:35:44,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2833251654006371 [2023-11-17 16:35:44,923 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4625 transitions. [2023-11-17 16:35:44,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4625 transitions. [2023-11-17 16:35:44,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:35:44,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4625 transitions. [2023-11-17 16:35:44,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 105.11363636363636) internal successors, (4625), 44 states have internal predecessors, (4625), 0 states have call successors, (0), 0 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:35:44,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 371.0) internal successors, (16695), 45 states have internal predecessors, (16695), 0 states have call successors, (0), 0 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:35:44,940 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 371.0) internal successors, (16695), 45 states have internal predecessors, (16695), 0 states have call successors, (0), 0 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:35:44,940 INFO L175 Difference]: Start difference. First operand has 194 places, 341 transitions, 3530 flow. Second operand 44 states and 4625 transitions. [2023-11-17 16:35:44,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 500 transitions, 5939 flow [2023-11-17 16:35:45,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 500 transitions, 5614 flow, removed 126 selfloop flow, removed 11 redundant places. [2023-11-17 16:35:45,050 INFO L231 Difference]: Finished difference. Result has 234 places, 380 transitions, 4567 flow [2023-11-17 16:35:45,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=3237, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4567, PETRI_PLACES=234, PETRI_TRANSITIONS=380} [2023-11-17 16:35:45,051 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 210 predicate places. [2023-11-17 16:35:45,051 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 380 transitions, 4567 flow [2023-11-17 16:35:45,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 101.60606060606061) internal successors, (3353), 33 states have internal predecessors, (3353), 0 states have call successors, (0), 0 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:35:45,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:35:45,052 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:35:45,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 16:35:45,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:35:45,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:35:45,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:35:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1136489972, now seen corresponding path program 5 times [2023-11-17 16:35:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:35:45,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676718999] [2023-11-17 16:35:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:35:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:35:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:35:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:35:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676718999] [2023-11-17 16:35:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676718999] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:35:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064295249] [2023-11-17 16:35:46,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:35:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:35:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:35:46,300 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:35:46,303 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:35:46,377 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:35:46,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:35:46,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 16:35:46,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:35:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:46,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:35:47,075 INFO L349 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-11-17 16:35:47,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 226 [2023-11-17 16:35:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064295249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:35:50,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:35:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-11-17 16:35:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105148170] [2023-11-17 16:35:50,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:35:50,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:35:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:35:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:35:50,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2023-11-17 16:35:50,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 371 [2023-11-17 16:35:50,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 380 transitions, 4567 flow. Second operand has 33 states, 33 states have (on average 101.60606060606061) internal successors, (3353), 33 states have internal predecessors, (3353), 0 states have call successors, (0), 0 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:35:50,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:35:50,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 371 [2023-11-17 16:35:50,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:35:55,106 INFO L124 PetriNetUnfolderBase]: 1218/2388 cut-off events. [2023-11-17 16:35:55,107 INFO L125 PetriNetUnfolderBase]: For 47698/47702 co-relation queries the response was YES. [2023-11-17 16:35:55,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17335 conditions, 2388 events. 1218/2388 cut-off events. For 47698/47702 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15599 event pairs, 101 based on Foata normal form. 4/2386 useless extension candidates. Maximal degree in co-relation 16964. Up to 674 conditions per place. [2023-11-17 16:35:55,128 INFO L140 encePairwiseOnDemand]: 359/371 looper letters, 160 selfloop transitions, 396 changer transitions 27/585 dead transitions. [2023-11-17 16:35:55,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 585 transitions, 7903 flow [2023-11-17 16:35:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-17 16:35:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-17 16:35:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5051 transitions. [2023-11-17 16:35:55,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28363656783468105 [2023-11-17 16:35:55,134 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 5051 transitions. [2023-11-17 16:35:55,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 5051 transitions. [2023-11-17 16:35:55,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:35:55,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 5051 transitions. [2023-11-17 16:35:55,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 105.22916666666667) internal successors, (5051), 48 states have internal predecessors, (5051), 0 states have call successors, (0), 0 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:35:55,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 371.0) internal successors, (18179), 49 states have internal predecessors, (18179), 0 states have call successors, (0), 0 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:35:55,154 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 371.0) internal successors, (18179), 49 states have internal predecessors, (18179), 0 states have call successors, (0), 0 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:35:55,154 INFO L175 Difference]: Start difference. First operand has 234 places, 380 transitions, 4567 flow. Second operand 48 states and 5051 transitions. [2023-11-17 16:35:55,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 585 transitions, 7903 flow [2023-11-17 16:35:55,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 585 transitions, 7523 flow, removed 122 selfloop flow, removed 20 redundant places. [2023-11-17 16:35:55,338 INFO L231 Difference]: Finished difference. Result has 268 places, 452 transitions, 6332 flow [2023-11-17 16:35:55,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=4287, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=325, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=6332, PETRI_PLACES=268, PETRI_TRANSITIONS=452} [2023-11-17 16:35:55,339 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 244 predicate places. [2023-11-17 16:35:55,339 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 452 transitions, 6332 flow [2023-11-17 16:35:55,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 101.60606060606061) internal successors, (3353), 33 states have internal predecessors, (3353), 0 states have call successors, (0), 0 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:35:55,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:35:55,340 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] [2023-11-17 16:35:55,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 16:35:55,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 16:35:55,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:35:55,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:35:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1022526925, now seen corresponding path program 6 times [2023-11-17 16:35:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:35:55,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990547822] [2023-11-17 16:35:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:35:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:35:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:35:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:35:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990547822] [2023-11-17 16:35:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990547822] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:35:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721169398] [2023-11-17 16:35:57,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:35:57,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:35:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:35:57,119 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:35:57,120 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:35:57,294 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 16:35:57,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:35:57,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:35:57,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:35:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:35:57,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:35:57,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:35:57,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 268 [2023-11-17 16:36:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:36:05,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721169398] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:36:05,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:36:05,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 24 [2023-11-17 16:36:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991610952] [2023-11-17 16:36:05,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:36:05,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 16:36:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:36:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 16:36:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2023-11-17 16:36:05,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 371 [2023-11-17 16:36:05,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 452 transitions, 6332 flow. Second operand has 26 states, 26 states have (on average 102.07692307692308) internal successors, (2654), 26 states have internal predecessors, (2654), 0 states have call successors, (0), 0 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:36:05,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:36:05,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 371 [2023-11-17 16:36:05,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:36:07,127 INFO L124 PetriNetUnfolderBase]: 1501/2902 cut-off events. [2023-11-17 16:36:07,127 INFO L125 PetriNetUnfolderBase]: For 69551/69575 co-relation queries the response was YES. [2023-11-17 16:36:07,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23098 conditions, 2902 events. 1501/2902 cut-off events. For 69551/69575 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 19506 event pairs, 271 based on Foata normal form. 5/2880 useless extension candidates. Maximal degree in co-relation 22686. Up to 1746 conditions per place. [2023-11-17 16:36:07,152 INFO L140 encePairwiseOnDemand]: 359/371 looper letters, 319 selfloop transitions, 286 changer transitions 17/624 dead transitions. [2023-11-17 16:36:07,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 624 transitions, 9840 flow [2023-11-17 16:36:07,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 16:36:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 16:36:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2629 transitions. [2023-11-17 16:36:07,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2834501347708895 [2023-11-17 16:36:07,155 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2629 transitions. [2023-11-17 16:36:07,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2629 transitions. [2023-11-17 16:36:07,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:36:07,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2629 transitions. [2023-11-17 16:36:07,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 105.16) internal successors, (2629), 25 states have internal predecessors, (2629), 0 states have call successors, (0), 0 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:36:07,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 371.0) internal successors, (9646), 26 states have internal predecessors, (9646), 0 states have call successors, (0), 0 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:36:07,163 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 371.0) internal successors, (9646), 26 states have internal predecessors, (9646), 0 states have call successors, (0), 0 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:36:07,163 INFO L175 Difference]: Start difference. First operand has 268 places, 452 transitions, 6332 flow. Second operand 25 states and 2629 transitions. [2023-11-17 16:36:07,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 624 transitions, 9840 flow [2023-11-17 16:36:07,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 624 transitions, 9306 flow, removed 138 selfloop flow, removed 23 redundant places. [2023-11-17 16:36:07,437 INFO L231 Difference]: Finished difference. Result has 282 places, 541 transitions, 8299 flow [2023-11-17 16:36:07,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=5859, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=8299, PETRI_PLACES=282, PETRI_TRANSITIONS=541} [2023-11-17 16:36:07,437 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 258 predicate places. [2023-11-17 16:36:07,437 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 541 transitions, 8299 flow [2023-11-17 16:36:07,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 102.07692307692308) internal successors, (2654), 26 states have internal predecessors, (2654), 0 states have call successors, (0), 0 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:36:07,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:36:07,438 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] [2023-11-17 16:36:07,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-17 16:36:07,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:36:07,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:36:07,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:36:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -59850039, now seen corresponding path program 7 times [2023-11-17 16:36:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:36:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424102905] [2023-11-17 16:36:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:36:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:36:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:36:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:36:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:36:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424102905] [2023-11-17 16:36:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424102905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:36:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287244268] [2023-11-17 16:36:08,855 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:36:08,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:36:08,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:36:08,857 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:36:08,861 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:36:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:36:08,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 16:36:08,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:36:09,079 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:36:09,128 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:36:09,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:36:09,228 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 29 treesize of output 22 [2023-11-17 16:36:09,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:09,481 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 50 treesize of output 38 [2023-11-17 16:36:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:36:09,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:36:10,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:10,269 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 118 treesize of output 82 [2023-11-17 16:36:10,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:10,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 385 [2023-11-17 16:36:10,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:10,334 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 164 treesize of output 168 [2023-11-17 16:36:10,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:10,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 190 [2023-11-17 16:36:23,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:23,518 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 118 treesize of output 82 [2023-11-17 16:36:23,565 INFO L349 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2023-11-17 16:36:23,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 413 [2023-11-17 16:36:23,619 INFO L349 Elim1Store]: treesize reduction 36, result has 55.6 percent of original size [2023-11-17 16:36:23,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 172 [2023-11-17 16:36:23,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:23,649 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 152 treesize of output 156 [2023-11-17 16:36:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:36:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287244268] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:36:25,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:36:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2023-11-17 16:36:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703251432] [2023-11-17 16:36:25,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:36:25,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 16:36:25,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:36:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 16:36:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1125, Unknown=2, NotChecked=0, Total=1260 [2023-11-17 16:36:25,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 371 [2023-11-17 16:36:25,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 541 transitions, 8299 flow. Second operand has 36 states, 36 states have (on average 92.5) internal successors, (3330), 36 states have internal predecessors, (3330), 0 states have call successors, (0), 0 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:36:25,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:36:25,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 371 [2023-11-17 16:36:25,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:36:25,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~q1_front~0 4)) (.cse6 (* c_~q1_back~0 4)) (.cse12 (+ |c_#StackHeapBarrier| 1)) (.cse0 (< c_~q2_back~0 0)) (.cse14 (= c_~q1_back~0 c_~q1_front~0)) (.cse13 (= c_~q2_front~0 c_~q2_back~0)) (.cse9 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse10 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse11 (< c_~q2_front~0 0))) (and (<= 0 c_~i~0) (= c_~i~0 0) (or .cse0 (let ((.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse3 (+ c_~i~0 1))) (and (forall ((v_ArrVal_303 (Array Int Int)) (~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303))) (let ((.cse1 (select .cse4 ~q1~0.base))) (or (< (select .cse1 (+ .cse2 ~q1~0.offset)) .cse3) (< (select (select .cse4 c_~q2~0.base) .cse5) c_~i~0) (not (= c_~j~0 (select .cse1 (+ .cse6 ~q1~0.offset)))))))) (forall ((v_ArrVal_303 (Array Int Int)) (~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303))) (let ((.cse7 (select .cse8 ~q1~0.base))) (or (< (select .cse7 (+ .cse2 ~q1~0.offset)) c_~i~0) (< (select (select .cse8 c_~q2~0.base) .cse5) .cse3) (not (= c_~j~0 (select .cse7 (+ .cse6 ~q1~0.offset)))))))))) .cse9 .cse10 .cse11 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= .cse12 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~n1~0) (or (< 0 c_~q1_back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) .cse13 (<= c_~q2_front~0 c_~q2_back~0) (<= .cse2 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~j~0 0) .cse14 (or .cse0 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse15 (< c_~j~0 c_~i~0))) (and (<= c_~j~0 c_~i~0) (or .cse15 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse14 (or .cse13 .cse15))) .cse9 .cse10 .cse11) (= c_~j~0 0))) is different from false [2023-11-17 16:36:30,711 INFO L124 PetriNetUnfolderBase]: 1644/3258 cut-off events. [2023-11-17 16:36:30,711 INFO L125 PetriNetUnfolderBase]: For 80773/80781 co-relation queries the response was YES. [2023-11-17 16:36:30,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26608 conditions, 3258 events. 1644/3258 cut-off events. For 80773/80781 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 23284 event pairs, 137 based on Foata normal form. 3/3248 useless extension candidates. Maximal degree in co-relation 26328. Up to 1200 conditions per place. [2023-11-17 16:36:30,757 INFO L140 encePairwiseOnDemand]: 358/371 looper letters, 185 selfloop transitions, 538 changer transitions 33/758 dead transitions. [2023-11-17 16:36:30,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 758 transitions, 12776 flow [2023-11-17 16:36:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-17 16:36:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-17 16:36:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 5336 transitions. [2023-11-17 16:36:30,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2568348093954563 [2023-11-17 16:36:30,763 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 5336 transitions. [2023-11-17 16:36:30,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 5336 transitions. [2023-11-17 16:36:30,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:36:30,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 5336 transitions. [2023-11-17 16:36:30,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 95.28571428571429) internal successors, (5336), 56 states have internal predecessors, (5336), 0 states have call successors, (0), 0 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:36:30,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 371.0) internal successors, (21147), 57 states have internal predecessors, (21147), 0 states have call successors, (0), 0 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:36:30,783 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 371.0) internal successors, (21147), 57 states have internal predecessors, (21147), 0 states have call successors, (0), 0 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:36:30,783 INFO L175 Difference]: Start difference. First operand has 282 places, 541 transitions, 8299 flow. Second operand 56 states and 5336 transitions. [2023-11-17 16:36:30,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 758 transitions, 12776 flow [2023-11-17 16:36:31,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 758 transitions, 12493 flow, removed 139 selfloop flow, removed 2 redundant places. [2023-11-17 16:36:31,240 INFO L231 Difference]: Finished difference. Result has 343 places, 624 transitions, 11013 flow [2023-11-17 16:36:31,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=8196, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=464, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=11013, PETRI_PLACES=343, PETRI_TRANSITIONS=624} [2023-11-17 16:36:31,241 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 319 predicate places. [2023-11-17 16:36:31,241 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 624 transitions, 11013 flow [2023-11-17 16:36:31,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 92.5) internal successors, (3330), 36 states have internal predecessors, (3330), 0 states have call successors, (0), 0 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:36:31,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:36:31,242 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] [2023-11-17 16:36:31,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 16:36:31,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:36:31,449 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:36:31,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:36:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2142036543, now seen corresponding path program 8 times [2023-11-17 16:36:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:36:31,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130867712] [2023-11-17 16:36:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:36:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:36:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:36:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:36:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:36:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130867712] [2023-11-17 16:36:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130867712] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:36:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532472819] [2023-11-17 16:36:32,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:36:32,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:36:32,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:36:32,915 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:36:32,917 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:36:32,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:36:32,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:36:32,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 16:36:33,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:36:33,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:33,162 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 62 treesize of output 42 [2023-11-17 16:36:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:36:33,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:36:33,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:33,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-11-17 16:36:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:36:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532472819] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:36:40,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:36:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 26 [2023-11-17 16:36:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521871674] [2023-11-17 16:36:40,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:36:40,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 16:36:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:36:40,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 16:36:40,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-11-17 16:36:40,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 371 [2023-11-17 16:36:40,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 624 transitions, 11013 flow. Second operand has 28 states, 28 states have (on average 92.92857142857143) internal successors, (2602), 28 states have internal predecessors, (2602), 0 states have call successors, (0), 0 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:36:40,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:36:40,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 371 [2023-11-17 16:36:40,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:36:43,582 INFO L124 PetriNetUnfolderBase]: 1840/3609 cut-off events. [2023-11-17 16:36:43,583 INFO L125 PetriNetUnfolderBase]: For 87545/87545 co-relation queries the response was YES. [2023-11-17 16:36:43,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31432 conditions, 3609 events. 1840/3609 cut-off events. For 87545/87545 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 25755 event pairs, 135 based on Foata normal form. 14/3617 useless extension candidates. Maximal degree in co-relation 31167. Up to 1583 conditions per place. [2023-11-17 16:36:43,619 INFO L140 encePairwiseOnDemand]: 358/371 looper letters, 250 selfloop transitions, 566 changer transitions 31/849 dead transitions. [2023-11-17 16:36:43,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 849 transitions, 15868 flow [2023-11-17 16:36:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 16:36:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-11-17 16:36:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3559 transitions. [2023-11-17 16:36:43,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2592700517228819 [2023-11-17 16:36:43,628 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3559 transitions. [2023-11-17 16:36:43,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3559 transitions. [2023-11-17 16:36:43,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:36:43,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3559 transitions. [2023-11-17 16:36:43,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 96.1891891891892) internal successors, (3559), 37 states have internal predecessors, (3559), 0 states have call successors, (0), 0 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:36:43,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 371.0) internal successors, (14098), 38 states have internal predecessors, (14098), 0 states have call successors, (0), 0 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:36:43,640 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 371.0) internal successors, (14098), 38 states have internal predecessors, (14098), 0 states have call successors, (0), 0 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:36:43,640 INFO L175 Difference]: Start difference. First operand has 343 places, 624 transitions, 11013 flow. Second operand 37 states and 3559 transitions. [2023-11-17 16:36:43,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 849 transitions, 15868 flow [2023-11-17 16:36:44,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 849 transitions, 15183 flow, removed 201 selfloop flow, removed 26 redundant places. [2023-11-17 16:36:44,252 INFO L231 Difference]: Finished difference. Result has 362 places, 741 transitions, 14725 flow [2023-11-17 16:36:44,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=10490, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=14725, PETRI_PLACES=362, PETRI_TRANSITIONS=741} [2023-11-17 16:36:44,253 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 338 predicate places. [2023-11-17 16:36:44,253 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 741 transitions, 14725 flow [2023-11-17 16:36:44,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 92.92857142857143) internal successors, (2602), 28 states have internal predecessors, (2602), 0 states have call successors, (0), 0 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:36:44,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:36:44,254 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] [2023-11-17 16:36:44,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-17 16:36:44,458 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,SelfDestructingSolverStorable12 [2023-11-17 16:36:44,458 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:36:44,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:36:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash -32144409, now seen corresponding path program 9 times [2023-11-17 16:36:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:36:44,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458622539] [2023-11-17 16:36:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:36:44,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:36:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:36:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:36:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:36:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458622539] [2023-11-17 16:36:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458622539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:36:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561587929] [2023-11-17 16:36:46,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:36:46,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:36:46,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:36:46,170 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:36:46,172 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:36:46,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:36:46,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:36:46,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-17 16:36:46,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:36:46,398 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:36:46,453 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:36:46,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:36:46,563 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 29 treesize of output 22 [2023-11-17 16:36:46,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:46,741 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 50 treesize of output 38 [2023-11-17 16:36:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:36:46,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:36:47,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:47,526 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 118 treesize of output 82 [2023-11-17 16:36:47,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:47,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 407 treesize of output 451 [2023-11-17 16:36:47,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:47,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 208 [2023-11-17 16:36:47,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:47,623 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 148 treesize of output 152 [2023-11-17 16:36:56,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:56,502 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 118 treesize of output 82 [2023-11-17 16:36:56,546 INFO L349 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2023-11-17 16:36:56,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 413 [2023-11-17 16:36:56,602 INFO L349 Elim1Store]: treesize reduction 36, result has 55.6 percent of original size [2023-11-17 16:36:56,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 172 [2023-11-17 16:36:56,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:36:56,636 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 152 treesize of output 156 [2023-11-17 16:36:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:36:58,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561587929] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:36:58,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:36:58,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 35 [2023-11-17 16:36:58,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889559416] [2023-11-17 16:36:58,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:36:58,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-17 16:36:58,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:36:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-17 16:36:58,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1193, Unknown=3, NotChecked=0, Total=1332 [2023-11-17 16:36:58,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 371 [2023-11-17 16:36:58,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 741 transitions, 14725 flow. Second operand has 37 states, 37 states have (on average 92.48648648648648) internal successors, (3422), 37 states have internal predecessors, (3422), 0 states have call successors, (0), 0 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:36:58,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:36:58,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 371 [2023-11-17 16:36:58,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:37:03,664 INFO L124 PetriNetUnfolderBase]: 1843/3567 cut-off events. [2023-11-17 16:37:03,664 INFO L125 PetriNetUnfolderBase]: For 80190/80190 co-relation queries the response was YES. [2023-11-17 16:37:03,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32056 conditions, 3567 events. 1843/3567 cut-off events. For 80190/80190 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 25169 event pairs, 77 based on Foata normal form. 3/3562 useless extension candidates. Maximal degree in co-relation 31793. Up to 1445 conditions per place. [2023-11-17 16:37:03,695 INFO L140 encePairwiseOnDemand]: 358/371 looper letters, 195 selfloop transitions, 665 changer transitions 22/884 dead transitions. [2023-11-17 16:37:03,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 884 transitions, 18208 flow [2023-11-17 16:37:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-17 16:37:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-17 16:37:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 5314 transitions. [2023-11-17 16:37:03,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2557758952637659 [2023-11-17 16:37:03,702 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 5314 transitions. [2023-11-17 16:37:03,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 5314 transitions. [2023-11-17 16:37:03,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:37:03,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 5314 transitions. [2023-11-17 16:37:03,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 94.89285714285714) internal successors, (5314), 56 states have internal predecessors, (5314), 0 states have call successors, (0), 0 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:37:03,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 371.0) internal successors, (21147), 57 states have internal predecessors, (21147), 0 states have call successors, (0), 0 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:37:03,728 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 371.0) internal successors, (21147), 57 states have internal predecessors, (21147), 0 states have call successors, (0), 0 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:37:03,728 INFO L175 Difference]: Start difference. First operand has 362 places, 741 transitions, 14725 flow. Second operand 56 states and 5314 transitions. [2023-11-17 16:37:03,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 884 transitions, 18208 flow [2023-11-17 16:37:04,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 884 transitions, 17844 flow, removed 115 selfloop flow, removed 10 redundant places. [2023-11-17 16:37:04,393 INFO L231 Difference]: Finished difference. Result has 412 places, 789 transitions, 17378 flow [2023-11-17 16:37:04,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=14371, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=620, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=17378, PETRI_PLACES=412, PETRI_TRANSITIONS=789} [2023-11-17 16:37:04,394 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 388 predicate places. [2023-11-17 16:37:04,394 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 789 transitions, 17378 flow [2023-11-17 16:37:04,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 92.48648648648648) internal successors, (3422), 37 states have internal predecessors, (3422), 0 states have call successors, (0), 0 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:37:04,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:37:04,395 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] [2023-11-17 16:37:04,401 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:37:04,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 16:37:04,600 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:37:04,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:37:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash 349242911, now seen corresponding path program 10 times [2023-11-17 16:37:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:37:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272665313] [2023-11-17 16:37:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:37:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:37:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:37:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:37:05,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:37:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272665313] [2023-11-17 16:37:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272665313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:37:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228328957] [2023-11-17 16:37:05,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:37:05,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:37:05,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:37:05,677 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:37:05,692 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:37:05,776 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:37:05,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:37:05,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-17 16:37:05,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:37:06,170 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-17 16:37:06,170 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 62 treesize of output 22 [2023-11-17 16:37:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:37:06,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:37:06,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:37:06,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 268 [2023-11-17 16:37:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:37:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228328957] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:37:14,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:37:14,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 27 [2023-11-17 16:37:14,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282813545] [2023-11-17 16:37:14,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:37:14,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 16:37:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:37:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 16:37:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2023-11-17 16:37:14,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 371 [2023-11-17 16:37:14,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 789 transitions, 17378 flow. Second operand has 29 states, 29 states have (on average 101.89655172413794) internal successors, (2955), 29 states have internal predecessors, (2955), 0 states have call successors, (0), 0 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:37:14,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:37:14,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 371 [2023-11-17 16:37:14,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:37:18,285 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 [0, 1] [2023-11-17 16:37:20,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 16:37:21,603 INFO L124 PetriNetUnfolderBase]: 1918/3669 cut-off events. [2023-11-17 16:37:21,603 INFO L125 PetriNetUnfolderBase]: For 89077/89077 co-relation queries the response was YES. [2023-11-17 16:37:21,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35721 conditions, 3669 events. 1918/3669 cut-off events. For 89077/89077 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 25645 event pairs, 92 based on Foata normal form. 21/3686 useless extension candidates. Maximal degree in co-relation 35513. Up to 1827 conditions per place. [2023-11-17 16:37:21,633 INFO L140 encePairwiseOnDemand]: 358/371 looper letters, 298 selfloop transitions, 610 changer transitions 55/965 dead transitions. [2023-11-17 16:37:21,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 965 transitions, 22622 flow [2023-11-17 16:37:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-17 16:37:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-17 16:37:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4806 transitions. [2023-11-17 16:37:21,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28161256299074183 [2023-11-17 16:37:21,637 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4806 transitions. [2023-11-17 16:37:21,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4806 transitions. [2023-11-17 16:37:21,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:37:21,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4806 transitions. [2023-11-17 16:37:21,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 104.47826086956522) internal successors, (4806), 46 states have internal predecessors, (4806), 0 states have call successors, (0), 0 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:37:21,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 371.0) internal successors, (17437), 47 states have internal predecessors, (17437), 0 states have call successors, (0), 0 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:37:21,670 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 371.0) internal successors, (17437), 47 states have internal predecessors, (17437), 0 states have call successors, (0), 0 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:37:21,671 INFO L175 Difference]: Start difference. First operand has 412 places, 789 transitions, 17378 flow. Second operand 46 states and 4806 transitions. [2023-11-17 16:37:21,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 965 transitions, 22622 flow [2023-11-17 16:37:22,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 965 transitions, 21369 flow, removed 349 selfloop flow, removed 44 redundant places. [2023-11-17 16:37:22,747 INFO L231 Difference]: Finished difference. Result has 428 places, 837 transitions, 19976 flow [2023-11-17 16:37:22,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=16526, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=19976, PETRI_PLACES=428, PETRI_TRANSITIONS=837} [2023-11-17 16:37:22,748 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 404 predicate places. [2023-11-17 16:37:22,748 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 837 transitions, 19976 flow [2023-11-17 16:37:22,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 101.89655172413794) internal successors, (2955), 29 states have internal predecessors, (2955), 0 states have call successors, (0), 0 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:37:22,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:37:22,749 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] [2023-11-17 16:37:22,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 16:37:22,952 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,SelfDestructingSolverStorable14 [2023-11-17 16:37:22,953 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:37:22,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:37:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -553123855, now seen corresponding path program 11 times [2023-11-17 16:37:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:37:22,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926043240] [2023-11-17 16:37:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:37:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:37:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:37:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:37:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:37:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926043240] [2023-11-17 16:37:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926043240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:37:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798309588] [2023-11-17 16:37:24,277 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:37:24,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:37:24,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:37:24,278 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:37:24,280 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:37:24,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:37:24,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:37:24,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 16:37:24,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:37:24,403 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-17 16:37:24,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2023-11-17 16:37:24,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 16:37:24,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:37:24,540 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-17 16:37:24,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 21 [2023-11-17 16:37:24,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:37:24,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:37:24,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:37:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:37:24,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-17 16:37:24,992 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-17 16:37:24,992 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 54 treesize of output 22 [2023-11-17 16:37:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:37:25,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:37:28,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:37:28,950 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 130 treesize of output 94 [2023-11-17 16:37:28,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:37:28,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4011 treesize of output 3895 [2023-11-17 16:37:29,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:37:29,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 403 [2023-11-17 16:37:29,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:37:29,099 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 413 treesize of output 381 [2023-11-17 16:37:29,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:37:29,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 297 treesize of output 329 [2023-11-17 16:38:13,875 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:38:13,876 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 16:38:13,883 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:38:13,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-17 16:38:14,081 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,SelfDestructingSolverStorable15 [2023-11-17 16:38:14,082 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$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.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) ... 69 more [2023-11-17 16:38:14,085 INFO L158 Benchmark]: Toolchain (without parser) took 240755.20ms. Allocated memory was 187.7MB in the beginning and 1.1GB in the end (delta: 921.7MB). Free memory was 149.5MB in the beginning and 849.8MB in the end (delta: -700.2MB). Peak memory consumption was 696.2MB. Max. memory is 8.0GB. [2023-11-17 16:38:14,085 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:38:14,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.82ms. Allocated memory is still 187.7MB. Free memory was 149.5MB in the beginning and 137.8MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:38:14,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.04ms. Allocated memory is still 187.7MB. Free memory was 137.8MB in the beginning and 135.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 16:38:14,085 INFO L158 Benchmark]: Boogie Preprocessor took 27.06ms. Allocated memory is still 187.7MB. Free memory was 135.3MB in the beginning and 133.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 16:38:14,086 INFO L158 Benchmark]: RCFGBuilder took 521.40ms. Allocated memory is still 187.7MB. Free memory was 133.6MB in the beginning and 102.7MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-11-17 16:38:14,086 INFO L158 Benchmark]: TraceAbstraction took 239954.68ms. Allocated memory was 187.7MB in the beginning and 1.1GB in the end (delta: 921.7MB). Free memory was 102.3MB in the beginning and 849.8MB in the end (delta: -747.5MB). Peak memory consumption was 649.0MB. Max. memory is 8.0GB. [2023-11-17 16:38:14,087 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 187.7MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.82ms. Allocated memory is still 187.7MB. Free memory was 149.5MB in the beginning and 137.8MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.04ms. Allocated memory is still 187.7MB. Free memory was 137.8MB in the beginning and 135.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.06ms. Allocated memory is still 187.7MB. Free memory was 135.3MB in the beginning and 133.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 521.40ms. Allocated memory is still 187.7MB. Free memory was 133.6MB in the beginning and 102.7MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 239954.68ms. Allocated memory was 187.7MB in the beginning and 1.1GB in the end (delta: 921.7MB). Free memory was 102.3MB in the beginning and 849.8MB in the end (delta: -747.5MB). Peak memory consumption was 649.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 168 PlacesBefore, 24 PlacesAfterwards, 174 TransitionsBefore, 21 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 8 FixpointIterations, 131 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 186 TotalNumberOfCompositions, 920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 776, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 416, independent: 404, independent conditional: 0, independent unconditional: 404, 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: 416, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 776, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 416, unknown conditional: 0, unknown unconditional: 416] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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...