/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-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:11:37,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:11:37,991 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:11:38,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:11:38,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:11:38,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:11:38,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:11:38,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:11:38,007 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:11:38,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:11:38,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:11:38,008 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:11:38,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:11:38,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:11:38,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:11:38,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:11:38,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:11:38,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:11:38,009 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:11:38,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:11:38,010 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:11:38,010 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:11:38,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:11:38,011 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:11:38,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:11:38,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:11:38,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:11:38,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:11:38,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:11:38,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:11:38,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:11:38,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:11:38,012 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:11:38,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:11:38,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:11:38,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:11:38,211 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:11:38,211 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:11:38,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-11-17 16:11:39,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:11:39,251 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:11:39,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-11-17 16:11:39,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73396f167/f88fc5077d8d4672b1b9c08a73283726/FLAG1f24405ac [2023-11-17 16:11:39,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73396f167/f88fc5077d8d4672b1b9c08a73283726 [2023-11-17 16:11:39,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:11:39,278 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:11:39,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:11:39,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:11:39,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:11:39,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791a9723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39, skipping insertion in model container [2023-11-17 16:11:39,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,308 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:11:39,429 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-commit-1.wvr.c[4643,4656] [2023-11-17 16:11:39,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:11:39,441 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:11:39,466 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-commit-1.wvr.c[4643,4656] [2023-11-17 16:11:39,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:11:39,473 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:11:39,473 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:11:39,478 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:11:39,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39 WrapperNode [2023-11-17 16:11:39,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:11:39,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:11:39,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:11:39,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:11:39,483 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:11:39" (1/1) ... [2023-11-17 16:11:39,490 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:11:39" (1/1) ... [2023-11-17 16:11:39,515 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 352 [2023-11-17 16:11:39,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:11:39,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:11:39,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:11:39,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:11:39,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:11:39,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:11:39,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:11:39,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:11:39,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (1/1) ... [2023-11-17 16:11:39,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:11:39,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:11:39,575 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:11:39,581 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:11:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:11:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:11:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:11:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:11:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:11:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:11:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:11:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:11:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:11:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:11:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:11:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:11:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:11:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:11:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:11:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:11:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:11:39,602 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:11:39,676 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:11:39,677 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:11:40,063 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:11:40,223 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:11:40,224 INFO L307 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-17 16:11:40,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:11:40 BoogieIcfgContainer [2023-11-17 16:11:40,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:11:40,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:11:40,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:11:40,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:11:40,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:11:39" (1/3) ... [2023-11-17 16:11:40,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dd8d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:11:40, skipping insertion in model container [2023-11-17 16:11:40,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:11:39" (2/3) ... [2023-11-17 16:11:40,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dd8d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:11:40, skipping insertion in model container [2023-11-17 16:11:40,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:11:40" (3/3) ... [2023-11-17 16:11:40,230 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-11-17 16:11:40,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:11:40,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:11:40,242 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:11:40,304 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:11:40,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 270 transitions, 561 flow [2023-11-17 16:11:40,387 INFO L124 PetriNetUnfolderBase]: 19/267 cut-off events. [2023-11-17 16:11:40,387 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:11:40,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 267 events. 19/267 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 153 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 228. Up to 2 conditions per place. [2023-11-17 16:11:40,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 270 transitions, 561 flow [2023-11-17 16:11:40,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 256 transitions, 530 flow [2023-11-17 16:11:40,398 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:11:40,405 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 256 transitions, 530 flow [2023-11-17 16:11:40,407 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 256 transitions, 530 flow [2023-11-17 16:11:40,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 256 transitions, 530 flow [2023-11-17 16:11:40,444 INFO L124 PetriNetUnfolderBase]: 19/256 cut-off events. [2023-11-17 16:11:40,445 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:11:40,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 256 events. 19/256 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 151 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 228. Up to 2 conditions per place. [2023-11-17 16:11:40,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 1666 [2023-11-17 16:11:47,624 INFO L134 LiptonReduction]: Checked pairs total: 3062 [2023-11-17 16:11:47,624 INFO L136 LiptonReduction]: Total number of compositions: 268 [2023-11-17 16:11:47,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:11:47,642 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;@3f520294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:11:47,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:11:47,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:11:47,647 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2023-11-17 16:11:47,647 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:11:47,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:47,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:47,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:47,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1100636173, now seen corresponding path program 1 times [2023-11-17 16:11:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:47,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742209141] [2023-11-17 16:11:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:48,045 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:11:48,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742209141] [2023-11-17 16:11:48,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742209141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:48,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:48,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:11:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837673375] [2023-11-17 16:11:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:48,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:11:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:11:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:11:48,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 538 [2023-11-17 16:11:48,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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:11:48,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:48,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 538 [2023-11-17 16:11:48,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:48,256 INFO L124 PetriNetUnfolderBase]: 919/1273 cut-off events. [2023-11-17 16:11:48,256 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-17 16:11:48,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 1273 events. 919/1273 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5058 event pairs, 151 based on Foata normal form. 1/892 useless extension candidates. Maximal degree in co-relation 2229. Up to 1148 conditions per place. [2023-11-17 16:11:48,266 INFO L140 encePairwiseOnDemand]: 533/538 looper letters, 42 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2023-11-17 16:11:48,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 227 flow [2023-11-17 16:11:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:11:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:11:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2023-11-17 16:11:48,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739776951672863 [2023-11-17 16:11:48,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 765 transitions. [2023-11-17 16:11:48,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 765 transitions. [2023-11-17 16:11:48,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:48,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 765 transitions. [2023-11-17 16:11:48,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:11:48,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:48,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:48,305 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 84 flow. Second operand 3 states and 765 transitions. [2023-11-17 16:11:48,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 227 flow [2023-11-17 16:11:48,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 205 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:11:48,311 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 98 flow [2023-11-17 16:11:48,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2023-11-17 16:11:48,315 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2023-11-17 16:11:48,315 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 98 flow [2023-11-17 16:11:48,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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:11:48,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:48,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:48,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:11:48,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:48,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash 133898429, now seen corresponding path program 1 times [2023-11-17 16:11:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101509579] [2023-11-17 16:11:48,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:48,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:48,431 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:11:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101509579] [2023-11-17 16:11:48,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101509579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:11:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543107094] [2023-11-17 16:11:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:48,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:11:48,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:48,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:11:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:11:48,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 538 [2023-11-17 16:11:48,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:11:48,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:48,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 538 [2023-11-17 16:11:48,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:48,595 INFO L124 PetriNetUnfolderBase]: 871/1256 cut-off events. [2023-11-17 16:11:48,595 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2023-11-17 16:11:48,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 1256 events. 871/1256 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5191 event pairs, 260 based on Foata normal form. 49/1166 useless extension candidates. Maximal degree in co-relation 2202. Up to 943 conditions per place. [2023-11-17 16:11:48,600 INFO L140 encePairwiseOnDemand]: 535/538 looper letters, 48 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-17 16:11:48,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 53 transitions, 240 flow [2023-11-17 16:11:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:11:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:11:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 763 transitions. [2023-11-17 16:11:48,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47273853779429986 [2023-11-17 16:11:48,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 763 transitions. [2023-11-17 16:11:48,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 763 transitions. [2023-11-17 16:11:48,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:48,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 763 transitions. [2023-11-17 16:11:48,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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:11:48,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:48,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:48,608 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 98 flow. Second operand 3 states and 763 transitions. [2023-11-17 16:11:48,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 53 transitions, 240 flow [2023-11-17 16:11:48,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:11:48,610 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 102 flow [2023-11-17 16:11:48,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2023-11-17 16:11:48,611 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2023-11-17 16:11:48,611 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 102 flow [2023-11-17 16:11:48,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:11:48,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:48,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:48,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:11:48,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:48,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1030875441, now seen corresponding path program 1 times [2023-11-17 16:11:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787074939] [2023-11-17 16:11:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:48,706 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:11:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:48,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787074939] [2023-11-17 16:11:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787074939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:48,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:11:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447938625] [2023-11-17 16:11:48,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:48,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:11:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:48,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:11:48,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:11:48,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 538 [2023-11-17 16:11:48,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:11:48,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:48,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 538 [2023-11-17 16:11:48,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:48,851 INFO L124 PetriNetUnfolderBase]: 932/1341 cut-off events. [2023-11-17 16:11:48,851 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2023-11-17 16:11:48,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 1341 events. 932/1341 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5566 event pairs, 235 based on Foata normal form. 34/1234 useless extension candidates. Maximal degree in co-relation 2059. Up to 957 conditions per place. [2023-11-17 16:11:48,856 INFO L140 encePairwiseOnDemand]: 535/538 looper letters, 42 selfloop transitions, 2 changer transitions 6/53 dead transitions. [2023-11-17 16:11:48,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 243 flow [2023-11-17 16:11:48,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:11:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:11:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2023-11-17 16:11:48,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739776951672863 [2023-11-17 16:11:48,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 765 transitions. [2023-11-17 16:11:48,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 765 transitions. [2023-11-17 16:11:48,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:48,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 765 transitions. [2023-11-17 16:11:48,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:11:48,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:48,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:48,863 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 102 flow. Second operand 3 states and 765 transitions. [2023-11-17 16:11:48,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 243 flow [2023-11-17 16:11:48,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:11:48,864 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 108 flow [2023-11-17 16:11:48,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2023-11-17 16:11:48,865 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-11-17 16:11:48,865 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 108 flow [2023-11-17 16:11:48,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:11:48,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:48,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:48,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:11:48,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:48,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1773185919, now seen corresponding path program 1 times [2023-11-17 16:11:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:48,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058689321] [2023-11-17 16:11:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:48,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:48,942 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:11:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058689321] [2023-11-17 16:11:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058689321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:11:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502439410] [2023-11-17 16:11:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:48,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:11:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:11:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:11:48,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 538 [2023-11-17 16:11:48,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:11:48,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:48,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 538 [2023-11-17 16:11:48,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:49,043 INFO L124 PetriNetUnfolderBase]: 486/724 cut-off events. [2023-11-17 16:11:49,043 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-11-17 16:11:49,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 724 events. 486/724 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2547 event pairs, 197 based on Foata normal form. 13/669 useless extension candidates. Maximal degree in co-relation 520. Up to 633 conditions per place. [2023-11-17 16:11:49,046 INFO L140 encePairwiseOnDemand]: 535/538 looper letters, 34 selfloop transitions, 2 changer transitions 7/46 dead transitions. [2023-11-17 16:11:49,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 217 flow [2023-11-17 16:11:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:11:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:11:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2023-11-17 16:11:49,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4677819083023544 [2023-11-17 16:11:49,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 755 transitions. [2023-11-17 16:11:49,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 755 transitions. [2023-11-17 16:11:49,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:49,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 755 transitions. [2023-11-17 16:11:49,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:11:49,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:49,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 538.0) internal successors, (2152), 4 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states 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:11:49,052 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 108 flow. Second operand 3 states and 755 transitions. [2023-11-17 16:11:49,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 217 flow [2023-11-17 16:11:49,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:11:49,054 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 118 flow [2023-11-17 16:11:49,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2023-11-17 16:11:49,054 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2023-11-17 16:11:49,054 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 118 flow [2023-11-17 16:11:49,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:11:49,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:49,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:49,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:11:49,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:49,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -511025785, now seen corresponding path program 1 times [2023-11-17 16:11:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843683647] [2023-11-17 16:11:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:49,155 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:11:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843683647] [2023-11-17 16:11:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843683647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:49,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:11:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058771096] [2023-11-17 16:11:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:49,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:11:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:49,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:11:49,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:11:49,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 538 [2023-11-17 16:11:49,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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:11:49,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:49,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 538 [2023-11-17 16:11:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:49,281 INFO L124 PetriNetUnfolderBase]: 527/819 cut-off events. [2023-11-17 16:11:49,281 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-11-17 16:11:49,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 819 events. 527/819 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3195 event pairs, 366 based on Foata normal form. 14/824 useless extension candidates. Maximal degree in co-relation 1318. Up to 718 conditions per place. [2023-11-17 16:11:49,284 INFO L140 encePairwiseOnDemand]: 530/538 looper letters, 33 selfloop transitions, 2 changer transitions 23/61 dead transitions. [2023-11-17 16:11:49,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 288 flow [2023-11-17 16:11:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:11:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:11:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1055 transitions. [2023-11-17 16:11:49,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39219330855018586 [2023-11-17 16:11:49,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1055 transitions. [2023-11-17 16:11:49,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1055 transitions. [2023-11-17 16:11:49,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:49,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1055 transitions. [2023-11-17 16:11:49,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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:11:49,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 538.0) internal successors, (3228), 6 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states 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:11:49,293 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 538.0) internal successors, (3228), 6 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states 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:11:49,293 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 118 flow. Second operand 5 states and 1055 transitions. [2023-11-17 16:11:49,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 288 flow [2023-11-17 16:11:49,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:11:49,295 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 138 flow [2023-11-17 16:11:49,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-17 16:11:49,295 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2023-11-17 16:11:49,295 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 138 flow [2023-11-17 16:11:49,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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:11:49,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:49,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:49,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 16:11:49,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:49,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1817238607, now seen corresponding path program 1 times [2023-11-17 16:11:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:49,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312720343] [2023-11-17 16:11:49,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:11:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312720343] [2023-11-17 16:11:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312720343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:49,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:49,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:11:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837487380] [2023-11-17 16:11:49,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:49,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:11:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:49,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:11:49,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:11:49,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 538 [2023-11-17 16:11:49,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 0 states 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:11:49,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:49,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 538 [2023-11-17 16:11:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:49,542 INFO L124 PetriNetUnfolderBase]: 572/896 cut-off events. [2023-11-17 16:11:49,543 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2023-11-17 16:11:49,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 896 events. 572/896 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3600 event pairs, 406 based on Foata normal form. 8/900 useless extension candidates. Maximal degree in co-relation 2285. Up to 716 conditions per place. [2023-11-17 16:11:49,546 INFO L140 encePairwiseOnDemand]: 533/538 looper letters, 33 selfloop transitions, 3 changer transitions 23/62 dead transitions. [2023-11-17 16:11:49,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 332 flow [2023-11-17 16:11:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:11:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:11:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 855 transitions. [2023-11-17 16:11:49,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730483271375466 [2023-11-17 16:11:49,548 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 855 transitions. [2023-11-17 16:11:49,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 855 transitions. [2023-11-17 16:11:49,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:49,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 855 transitions. [2023-11-17 16:11:49,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 213.75) internal successors, (855), 4 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:11:49,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 538.0) internal successors, (2690), 5 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:11:49,552 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 538.0) internal successors, (2690), 5 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:11:49,552 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 138 flow. Second operand 4 states and 855 transitions. [2023-11-17 16:11:49,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 332 flow [2023-11-17 16:11:49,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 308 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-17 16:11:49,555 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 142 flow [2023-11-17 16:11:49,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-17 16:11:49,555 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2023-11-17 16:11:49,555 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 142 flow [2023-11-17 16:11:49,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 0 states 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:11:49,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:49,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:49,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 16:11:49,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:49,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash -317391252, now seen corresponding path program 1 times [2023-11-17 16:11:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:49,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799798693] [2023-11-17 16:11:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:11:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799798693] [2023-11-17 16:11:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799798693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:11:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540262089] [2023-11-17 16:11:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:11:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:49,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:11:49,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:11:49,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 538 [2023-11-17 16:11:49,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 0 states 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:11:49,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:49,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 538 [2023-11-17 16:11:49,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:49,788 INFO L124 PetriNetUnfolderBase]: 547/855 cut-off events. [2023-11-17 16:11:49,788 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2023-11-17 16:11:49,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 855 events. 547/855 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3447 event pairs, 390 based on Foata normal form. 4/855 useless extension candidates. Maximal degree in co-relation 2153. Up to 714 conditions per place. [2023-11-17 16:11:49,792 INFO L140 encePairwiseOnDemand]: 533/538 looper letters, 34 selfloop transitions, 3 changer transitions 17/57 dead transitions. [2023-11-17 16:11:49,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 298 flow [2023-11-17 16:11:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:11:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:11:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 849 transitions. [2023-11-17 16:11:49,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945167286245353 [2023-11-17 16:11:49,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 849 transitions. [2023-11-17 16:11:49,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 849 transitions. [2023-11-17 16:11:49,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:49,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 849 transitions. [2023-11-17 16:11:49,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:11:49,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 538.0) internal successors, (2690), 5 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:11:49,798 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 538.0) internal successors, (2690), 5 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:11:49,798 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 142 flow. Second operand 4 states and 849 transitions. [2023-11-17 16:11:49,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 298 flow [2023-11-17 16:11:49,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 288 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 16:11:49,800 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 150 flow [2023-11-17 16:11:49,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-17 16:11:49,801 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2023-11-17 16:11:49,801 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 150 flow [2023-11-17 16:11:49,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 0 states 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:11:49,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:49,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:49,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 16:11:49,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:49,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash 870757549, now seen corresponding path program 1 times [2023-11-17 16:11:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886268827] [2023-11-17 16:11:49,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:11:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886268827] [2023-11-17 16:11:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886268827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:11:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:11:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:11:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228279218] [2023-11-17 16:11:49,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:11:49,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:11:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:11:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:11:49,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 538 [2023-11-17 16:11:49,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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:11:49,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:49,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 538 [2023-11-17 16:11:49,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:50,082 INFO L124 PetriNetUnfolderBase]: 881/1338 cut-off events. [2023-11-17 16:11:50,082 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2023-11-17 16:11:50,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3481 conditions, 1338 events. 881/1338 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5063 event pairs, 346 based on Foata normal form. 42/1378 useless extension candidates. Maximal degree in co-relation 3453. Up to 492 conditions per place. [2023-11-17 16:11:50,088 INFO L140 encePairwiseOnDemand]: 533/538 looper letters, 64 selfloop transitions, 9 changer transitions 0/76 dead transitions. [2023-11-17 16:11:50,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 412 flow [2023-11-17 16:11:50,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:11:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:11:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1018 transitions. [2023-11-17 16:11:50,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47304832713754646 [2023-11-17 16:11:50,090 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1018 transitions. [2023-11-17 16:11:50,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1018 transitions. [2023-11-17 16:11:50,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:50,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1018 transitions. [2023-11-17 16:11:50,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 254.5) internal successors, (1018), 4 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states 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:11:50,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 538.0) internal successors, (2690), 5 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:11:50,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 538.0) internal successors, (2690), 5 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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:11:50,095 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 150 flow. Second operand 4 states and 1018 transitions. [2023-11-17 16:11:50,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 412 flow [2023-11-17 16:11:50,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 402 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 16:11:50,098 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 203 flow [2023-11-17 16:11:50,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-11-17 16:11:50,100 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2023-11-17 16:11:50,100 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 203 flow [2023-11-17 16:11:50,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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:11:50,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:50,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:50,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 16:11:50,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:50,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1081618827, now seen corresponding path program 1 times [2023-11-17 16:11:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735598494] [2023-11-17 16:11:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:11:50,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:50,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735598494] [2023-11-17 16:11:50,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735598494] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:11:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919662182] [2023-11-17 16:11:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:50,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:11:50,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:11:50,314 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:11:50,336 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:11:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:50,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:11:50,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:11:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:11:50,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:11:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:11:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919662182] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:11:50,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:11:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 16:11:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391340830] [2023-11-17 16:11:50,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:11:50,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:11:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:50,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:11:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:11:50,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 538 [2023-11-17 16:11:50,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 203 flow. Second operand has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:11:50,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:50,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 538 [2023-11-17 16:11:50,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:50,949 INFO L124 PetriNetUnfolderBase]: 949/1484 cut-off events. [2023-11-17 16:11:50,949 INFO L125 PetriNetUnfolderBase]: For 1352/1352 co-relation queries the response was YES. [2023-11-17 16:11:50,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4435 conditions, 1484 events. 949/1484 cut-off events. For 1352/1352 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5981 event pairs, 669 based on Foata normal form. 2/1483 useless extension candidates. Maximal degree in co-relation 4040. Up to 1331 conditions per place. [2023-11-17 16:11:50,955 INFO L140 encePairwiseOnDemand]: 532/538 looper letters, 41 selfloop transitions, 3 changer transitions 32/79 dead transitions. [2023-11-17 16:11:50,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 465 flow [2023-11-17 16:11:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:11:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:11:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1449 transitions. [2023-11-17 16:11:50,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3847583643122677 [2023-11-17 16:11:50,960 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1449 transitions. [2023-11-17 16:11:50,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1449 transitions. [2023-11-17 16:11:50,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:50,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1449 transitions. [2023-11-17 16:11:50,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states 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:11:50,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 538.0) internal successors, (4304), 8 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states 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:11:50,967 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 538.0) internal successors, (4304), 8 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states 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:11:50,967 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 203 flow. Second operand 7 states and 1449 transitions. [2023-11-17 16:11:50,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 465 flow [2023-11-17 16:11:50,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 457 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-17 16:11:50,970 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 219 flow [2023-11-17 16:11:50,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-17 16:11:50,971 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2023-11-17 16:11:50,971 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 219 flow [2023-11-17 16:11:50,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:11:50,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:50,972 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:50,980 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:11:51,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:11:51,181 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:51,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash -977798541, now seen corresponding path program 2 times [2023-11-17 16:11:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:51,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89578121] [2023-11-17 16:11:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 16:11:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89578121] [2023-11-17 16:11:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89578121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:11:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801478327] [2023-11-17 16:11:51,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:11:51,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:11:51,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:11:51,351 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:11:51,358 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:11:51,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:11:51,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:11:51,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:11:51,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:11:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 16:11:51,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:11:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 16:11:51,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801478327] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:11:51,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:11:51,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 16:11:51,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628067674] [2023-11-17 16:11:51,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:11:51,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:11:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:11:51,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:11:51,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:11:51,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 538 [2023-11-17 16:11:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 219 flow. Second operand has 12 states, 12 states have (on average 202.16666666666666) internal successors, (2426), 12 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states 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:11:51,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:11:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 538 [2023-11-17 16:11:51,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:11:51,956 INFO L124 PetriNetUnfolderBase]: 1118/1796 cut-off events. [2023-11-17 16:11:51,957 INFO L125 PetriNetUnfolderBase]: For 1987/1987 co-relation queries the response was YES. [2023-11-17 16:11:51,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5362 conditions, 1796 events. 1118/1796 cut-off events. For 1987/1987 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7858 event pairs, 731 based on Foata normal form. 132/1927 useless extension candidates. Maximal degree in co-relation 5328. Up to 1328 conditions per place. [2023-11-17 16:11:51,965 INFO L140 encePairwiseOnDemand]: 531/538 looper letters, 39 selfloop transitions, 6 changer transitions 44/92 dead transitions. [2023-11-17 16:11:51,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 585 flow [2023-11-17 16:11:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:11:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 16:11:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1854 transitions. [2023-11-17 16:11:51,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828996282527881 [2023-11-17 16:11:51,970 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1854 transitions. [2023-11-17 16:11:51,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1854 transitions. [2023-11-17 16:11:51,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:11:51,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1854 transitions. [2023-11-17 16:11:51,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states 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:11:51,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 538.0) internal successors, (5380), 10 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states 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:11:51,986 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 538.0) internal successors, (5380), 10 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states 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:11:51,986 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 219 flow. Second operand 9 states and 1854 transitions. [2023-11-17 16:11:51,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 585 flow [2023-11-17 16:11:51,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 563 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-17 16:11:51,990 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 233 flow [2023-11-17 16:11:51,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=233, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-11-17 16:11:51,990 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-11-17 16:11:51,990 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 233 flow [2023-11-17 16:11:51,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 202.16666666666666) internal successors, (2426), 12 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states 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:11:51,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:11:51,991 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:11:52,016 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:11:52,203 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,SelfDestructingSolverStorable9 [2023-11-17 16:11:52,203 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:11:52,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:11:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash -746250844, now seen corresponding path program 3 times [2023-11-17 16:11:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:11:52,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087190290] [2023-11-17 16:11:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:11:52,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:11:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:11:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:11:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:11:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087190290] [2023-11-17 16:11:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087190290] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:11:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995811858] [2023-11-17 16:11:55,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:11:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:11:55,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:11:55,027 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:11:55,029 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:11:55,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 16:11:55,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:11:55,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-17 16:11:55,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:11:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:11:56,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:11:58,784 INFO L349 Elim1Store]: treesize reduction 39, result has 88.4 percent of original size [2023-11-17 16:11:58,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 104 treesize of output 316 [2023-11-17 16:12:00,716 INFO L349 Elim1Store]: treesize reduction 662, result has 65.1 percent of original size [2023-11-17 16:12:00,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 318 treesize of output 1298 [2023-11-17 16:13:51,014 INFO L349 Elim1Store]: treesize reduction 30, result has 87.6 percent of original size [2023-11-17 16:13:51,014 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 85 treesize of output 228 [2023-11-17 16:13:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:13:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995811858] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:13:52,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:13:52,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2023-11-17 16:13:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521306112] [2023-11-17 16:13:52,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:13:52,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-17 16:13:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:13:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-17 16:13:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2382, Unknown=0, NotChecked=0, Total=2756 [2023-11-17 16:13:52,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 538 [2023-11-17 16:13:52,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 233 flow. Second operand has 53 states, 53 states have (on average 156.81132075471697) internal successors, (8311), 53 states have internal predecessors, (8311), 0 states have call successors, (0), 0 states 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:13:52,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:13:52,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 538 [2023-11-17 16:13:52,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:14:03,550 INFO L124 PetriNetUnfolderBase]: 2082/3324 cut-off events. [2023-11-17 16:14:03,551 INFO L125 PetriNetUnfolderBase]: For 3953/3953 co-relation queries the response was YES. [2023-11-17 16:14:03,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10108 conditions, 3324 events. 2082/3324 cut-off events. For 3953/3953 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16610 event pairs, 502 based on Foata normal form. 18/3332 useless extension candidates. Maximal degree in co-relation 7465. Up to 1568 conditions per place. [2023-11-17 16:14:03,570 INFO L140 encePairwiseOnDemand]: 522/538 looper letters, 204 selfloop transitions, 153 changer transitions 70/430 dead transitions. [2023-11-17 16:14:03,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 430 transitions, 2556 flow [2023-11-17 16:14:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-17 16:14:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-11-17 16:14:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 10792 transitions. [2023-11-17 16:14:03,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.299395217222438 [2023-11-17 16:14:03,594 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 10792 transitions. [2023-11-17 16:14:03,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 10792 transitions. [2023-11-17 16:14:03,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:14:03,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 10792 transitions. [2023-11-17 16:14:03,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 161.07462686567163) internal successors, (10792), 67 states have internal predecessors, (10792), 0 states have call successors, (0), 0 states 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:14:03,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 538.0) internal successors, (36584), 68 states have internal predecessors, (36584), 0 states have call successors, (0), 0 states 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:14:03,657 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 538.0) internal successors, (36584), 68 states have internal predecessors, (36584), 0 states have call successors, (0), 0 states 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:14:03,657 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 233 flow. Second operand 67 states and 10792 transitions. [2023-11-17 16:14:03,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 430 transitions, 2556 flow [2023-11-17 16:14:03,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 430 transitions, 2475 flow, removed 35 selfloop flow, removed 6 redundant places. [2023-11-17 16:14:03,670 INFO L231 Difference]: Finished difference. Result has 126 places, 198 transitions, 1476 flow [2023-11-17 16:14:03,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=538, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=1476, PETRI_PLACES=126, PETRI_TRANSITIONS=198} [2023-11-17 16:14:03,671 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 89 predicate places. [2023-11-17 16:14:03,671 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 198 transitions, 1476 flow [2023-11-17 16:14:03,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 156.81132075471697) internal successors, (8311), 53 states have internal predecessors, (8311), 0 states have call successors, (0), 0 states 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:14:03,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:14:03,673 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:14:03,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 16:14:03,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:14:03,879 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:14:03,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:14:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 342215321, now seen corresponding path program 4 times [2023-11-17 16:14:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:14:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164807702] [2023-11-17 16:14:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:14:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:14:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:14:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:14:07,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:14:07,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164807702] [2023-11-17 16:14:07,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164807702] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:14:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623395700] [2023-11-17 16:14:07,279 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:14:07,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:14:07,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:14:07,280 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:14:07,280 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:14:07,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:14:07,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:14:07,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-17 16:14:07,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:14:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:14:08,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:14:34,679 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~manager~0.base))) (let ((.cse7 (* c_~client_back~0 4)) (.cse4 (select .cse5 (+ c_~manager~0.offset (* c_~manager_back~0 4))))) (let ((.cse3 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse8 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse4 (select .cse8 (+ .cse7 ~client~0.offset)))) (= (select .cse8 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse4)))))) (let ((.cse1 (= (mod c_~safe~0 256) 0)) (.cse0 (and .cse3 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse4 (select (select |c_#memory_int| ~client~0.base) (+ .cse7 ~client~0.offset)))))))) (and (or .cse0 (not .cse1)) (or .cse1 (let ((.cse6 (= c_~update~0 (select (select |c_#memory_int| c_~node~0.base) (+ (* c_~node_front~0 4) c_~node~0.offset))))) (and (or (let ((.cse2 (= .cse4 (select .cse5 (+ (* 4 c_~manager_front~0) c_~manager~0.offset))))) (and (or .cse0 .cse2) (or (not .cse2) .cse3))) (not .cse6)) (or .cse0 .cse6))))))))) is different from false [2023-11-17 16:14:37,492 INFO L349 Elim1Store]: treesize reduction 19, result has 92.5 percent of original size [2023-11-17 16:14:37,492 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 85 treesize of output 250 [2023-11-17 16:14:41,600 INFO L349 Elim1Store]: treesize reduction 38, result has 98.1 percent of original size [2023-11-17 16:14:41,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 318 treesize of output 2057 [2023-11-17 16:15:21,853 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:15:21,854 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:15:21,855 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 16:15:21,860 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:15:22,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:15:22,058 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.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) 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:140) 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) ... 61 more [2023-11-17 16:15:22,061 INFO L158 Benchmark]: Toolchain (without parser) took 222782.71ms. Allocated memory was 274.7MB in the beginning and 852.5MB in the end (delta: 577.8MB). Free memory was 221.2MB in the beginning and 428.4MB in the end (delta: -207.2MB). Peak memory consumption was 528.8MB. Max. memory is 8.0GB. [2023-11-17 16:15:22,061 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:15:22,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.11ms. Allocated memory is still 274.7MB. Free memory was 220.8MB in the beginning and 207.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 16:15:22,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.71ms. Allocated memory is still 274.7MB. Free memory was 207.8MB in the beginning and 205.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 16:15:22,061 INFO L158 Benchmark]: Boogie Preprocessor took 29.22ms. Allocated memory is still 274.7MB. Free memory was 205.0MB in the beginning and 202.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:15:22,062 INFO L158 Benchmark]: RCFGBuilder took 679.09ms. Allocated memory is still 274.7MB. Free memory was 202.6MB in the beginning and 208.4MB in the end (delta: -5.8MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2023-11-17 16:15:22,062 INFO L158 Benchmark]: TraceAbstraction took 221834.15ms. Allocated memory was 274.7MB in the beginning and 852.5MB in the end (delta: 577.8MB). Free memory was 207.9MB in the beginning and 428.4MB in the end (delta: -220.5MB). Peak memory consumption was 514.4MB. Max. memory is 8.0GB. [2023-11-17 16:15:22,062 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.11ms. Allocated memory is still 274.7MB. Free memory was 220.8MB in the beginning and 207.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.71ms. Allocated memory is still 274.7MB. Free memory was 207.8MB in the beginning and 205.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.22ms. Allocated memory is still 274.7MB. Free memory was 205.0MB in the beginning and 202.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 679.09ms. Allocated memory is still 274.7MB. Free memory was 202.6MB in the beginning and 208.4MB in the end (delta: -5.8MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * TraceAbstraction took 221834.15ms. Allocated memory was 274.7MB in the beginning and 852.5MB in the end (delta: 577.8MB). Free memory was 207.9MB in the beginning and 428.4MB in the end (delta: -220.5MB). Peak memory consumption was 514.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 247 PlacesBefore, 37 PlacesAfterwards, 256 TransitionsBefore, 33 TransitionsAfterwards, 1666 CoEnabledTransitionPairs, 7 FixpointIterations, 180 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 11 ConcurrentYvCompositions, 13 ChoiceCompositions, 268 TotalNumberOfCompositions, 3062 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2176, independent: 2092, independent conditional: 0, independent unconditional: 2092, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1219, independent: 1188, independent conditional: 0, independent unconditional: 1188, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1219, independent: 1180, independent conditional: 0, independent unconditional: 1180, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2176, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 1219, unknown conditional: 0, unknown unconditional: 1219] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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...