/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-three-array-min.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:33:13,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:33:13,789 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:33:13,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:33:13,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:33:13,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:33:13,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:33:13,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:33:13,816 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:33:13,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:33:13,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:33:13,820 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:33:13,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:33:13,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:33:13,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:33:13,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:33:13,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:33:13,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:33:13,822 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:33:13,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:33:13,822 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:33:13,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:33:13,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:33:13,823 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:33:13,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:33:13,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:33:13,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:33:13,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:33:13,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:33:13,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:33:13,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:33:13,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:33:13,826 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:33:14,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:33:14,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:33:14,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:33:14,035 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:33:14,035 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:33:14,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2023-11-17 16:33:15,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:33:15,256 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:33:15,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2023-11-17 16:33:15,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25741f2d0/53e94a88c27f4113bab3c802a4ca1814/FLAGc97e3feff [2023-11-17 16:33:15,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25741f2d0/53e94a88c27f4113bab3c802a4ca1814 [2023-11-17 16:33:15,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:33:15,279 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:33:15,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:33:15,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:33:15,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:33:15,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d238f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15, skipping insertion in model container [2023-11-17 16:33:15,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:33:15,442 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-three-array-min.wvr.c[2854,2867] [2023-11-17 16:33:15,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:33:15,460 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:33:15,491 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-three-array-min.wvr.c[2854,2867] [2023-11-17 16:33:15,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:33:15,499 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:33:15,499 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:33:15,508 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:33:15,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15 WrapperNode [2023-11-17 16:33:15,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:33:15,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:33:15,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:33:15,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:33:15,514 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:33:15" (1/1) ... [2023-11-17 16:33:15,520 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:33:15" (1/1) ... [2023-11-17 16:33:15,541 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 240 [2023-11-17 16:33:15,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:33:15,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:33:15,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:33:15,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:33:15,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:33:15,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:33:15,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:33:15,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:33:15,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (1/1) ... [2023-11-17 16:33:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:33:15,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:15,630 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:33:15,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 16:33:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:33:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:33:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:33:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:33:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:33:15,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:33:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:33:15,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:33:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:33:15,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:33:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:33:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:33:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:33:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:33:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:33:15,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:33:15,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:33:15,660 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:33:15,772 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:33:15,775 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:33:16,131 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:33:16,212 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:33:16,212 INFO L307 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-17 16:33:16,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:33:16 BoogieIcfgContainer [2023-11-17 16:33:16,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:33:16,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:33:16,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:33:16,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:33:16,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:33:15" (1/3) ... [2023-11-17 16:33:16,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baa185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:33:16, skipping insertion in model container [2023-11-17 16:33:16,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:33:15" (2/3) ... [2023-11-17 16:33:16,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baa185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:33:16, skipping insertion in model container [2023-11-17 16:33:16,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:33:16" (3/3) ... [2023-11-17 16:33:16,219 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2023-11-17 16:33:16,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:33:16,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:33:16,232 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:33:16,303 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:33:16,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 324 transitions, 669 flow [2023-11-17 16:33:16,428 INFO L124 PetriNetUnfolderBase]: 27/321 cut-off events. [2023-11-17 16:33:16,428 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:33:16,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 321 events. 27/321 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 247 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 251. Up to 2 conditions per place. [2023-11-17 16:33:16,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 324 transitions, 669 flow [2023-11-17 16:33:16,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 293 places, 310 transitions, 638 flow [2023-11-17 16:33:16,445 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:33:16,452 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 310 transitions, 638 flow [2023-11-17 16:33:16,454 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 310 transitions, 638 flow [2023-11-17 16:33:16,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 310 transitions, 638 flow [2023-11-17 16:33:16,496 INFO L124 PetriNetUnfolderBase]: 27/310 cut-off events. [2023-11-17 16:33:16,496 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:33:16,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 310 events. 27/310 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 247 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 251. Up to 2 conditions per place. [2023-11-17 16:33:16,499 INFO L119 LiptonReduction]: Number of co-enabled transitions 3186 [2023-11-17 16:33:23,734 INFO L134 LiptonReduction]: Checked pairs total: 4431 [2023-11-17 16:33:23,735 INFO L136 LiptonReduction]: Total number of compositions: 346 [2023-11-17 16:33:23,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:33:23,750 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;@74d3fd7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:33:23,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:33:23,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:33:23,755 INFO L124 PetriNetUnfolderBase]: 8/34 cut-off events. [2023-11-17 16:33:23,755 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:33:23,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:23,756 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:33:23,757 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:33:23,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash -189290659, now seen corresponding path program 1 times [2023-11-17 16:33:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:23,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45085787] [2023-11-17 16:33:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:24,059 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:33:24,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:24,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45085787] [2023-11-17 16:33:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45085787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:33:24,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:33:24,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:33:24,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81675105] [2023-11-17 16:33:24,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:33:24,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:33:24,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:24,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:33:24,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:33:24,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 670 [2023-11-17 16:33:24,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:33:24,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:24,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 670 [2023-11-17 16:33:24,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:24,229 INFO L124 PetriNetUnfolderBase]: 660/923 cut-off events. [2023-11-17 16:33:24,229 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-17 16:33:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 923 events. 660/923 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2788 event pairs, 415 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 1688. Up to 923 conditions per place. [2023-11-17 16:33:24,237 INFO L140 encePairwiseOnDemand]: 667/670 looper letters, 34 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-11-17 16:33:24,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 162 flow [2023-11-17 16:33:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:33:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:33:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2023-11-17 16:33:24,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034825870646766 [2023-11-17 16:33:24,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2023-11-17 16:33:24,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2023-11-17 16:33:24,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:24,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2023-11-17 16:33:24,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:33:24,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 670.0) internal successors, (2680), 4 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states 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:33:24,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 670.0) internal successors, (2680), 4 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states 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:33:24,273 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 88 flow. Second operand 3 states and 811 transitions. [2023-11-17 16:33:24,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 162 flow [2023-11-17 16:33:24,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:33:24,280 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 88 flow [2023-11-17 16:33:24,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=88, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2023-11-17 16:33:24,285 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2023-11-17 16:33:24,285 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 88 flow [2023-11-17 16:33:24,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:33:24,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:24,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:33:24,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:33:24,286 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:33:24,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:24,287 INFO L85 PathProgramCache]: Analyzing trace with hash -551627445, now seen corresponding path program 1 times [2023-11-17 16:33:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43730424] [2023-11-17 16:33:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:33:24,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:24,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43730424] [2023-11-17 16:33:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43730424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:33:24,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:33:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:33:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319064908] [2023-11-17 16:33:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:33:24,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:33:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:33:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:33:24,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 670 [2023-11-17 16:33:24,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states 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:33:24,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:24,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 670 [2023-11-17 16:33:24,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:24,582 INFO L124 PetriNetUnfolderBase]: 660/925 cut-off events. [2023-11-17 16:33:24,582 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-17 16:33:24,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 925 events. 660/925 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2782 event pairs, 415 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1877. Up to 922 conditions per place. [2023-11-17 16:33:24,586 INFO L140 encePairwiseOnDemand]: 663/670 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-11-17 16:33:24,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 168 flow [2023-11-17 16:33:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:33:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:33:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1024 transitions. [2023-11-17 16:33:24,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.382089552238806 [2023-11-17 16:33:24,590 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1024 transitions. [2023-11-17 16:33:24,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1024 transitions. [2023-11-17 16:33:24,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:24,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1024 transitions. [2023-11-17 16:33:24,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states 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:33:24,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 670.0) internal successors, (3350), 5 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states 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:33:24,596 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 670.0) internal successors, (3350), 5 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states 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:33:24,596 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 88 flow. Second operand 4 states and 1024 transitions. [2023-11-17 16:33:24,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 168 flow [2023-11-17 16:33:24,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 16:33:24,597 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 112 flow [2023-11-17 16:33:24,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2023-11-17 16:33:24,598 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-11-17 16:33:24,599 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 112 flow [2023-11-17 16:33:24,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states 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:33:24,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:24,600 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] [2023-11-17 16:33:24,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:33:24,602 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:33:24,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2053440667, now seen corresponding path program 1 times [2023-11-17 16:33:24,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:24,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864629646] [2023-11-17 16:33:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:33:24,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:24,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864629646] [2023-11-17 16:33:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864629646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:33:24,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:33:24,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:33:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245017560] [2023-11-17 16:33:24,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:33:24,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:33:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:24,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:33:24,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:33:24,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 670 [2023-11-17 16:33:24,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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:33:24,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:24,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 670 [2023-11-17 16:33:24,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:24,850 INFO L124 PetriNetUnfolderBase]: 1207/1683 cut-off events. [2023-11-17 16:33:24,850 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-17 16:33:24,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3435 conditions, 1683 events. 1207/1683 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5997 event pairs, 357 based on Foata normal form. 1/1225 useless extension candidates. Maximal degree in co-relation 3415. Up to 980 conditions per place. [2023-11-17 16:33:24,857 INFO L140 encePairwiseOnDemand]: 665/670 looper letters, 58 selfloop transitions, 4 changer transitions 1/63 dead transitions. [2023-11-17 16:33:24,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 63 transitions, 293 flow [2023-11-17 16:33:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:33:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:33:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2023-11-17 16:33:24,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527363184079602 [2023-11-17 16:33:24,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 910 transitions. [2023-11-17 16:33:24,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 910 transitions. [2023-11-17 16:33:24,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:24,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 910 transitions. [2023-11-17 16:33:24,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states 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:33:24,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 670.0) internal successors, (2680), 4 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states 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:33:24,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 670.0) internal successors, (2680), 4 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states 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:33:24,864 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 112 flow. Second operand 3 states and 910 transitions. [2023-11-17 16:33:24,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 63 transitions, 293 flow [2023-11-17 16:33:24,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:33:24,866 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 137 flow [2023-11-17 16:33:24,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2023-11-17 16:33:24,866 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-11-17 16:33:24,866 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 137 flow [2023-11-17 16:33:24,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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:33:24,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:24,867 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] [2023-11-17 16:33:24,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:33:24,867 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:33:24,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1619819680, now seen corresponding path program 1 times [2023-11-17 16:33:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93874424] [2023-11-17 16:33:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:33:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:24,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93874424] [2023-11-17 16:33:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93874424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:24,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286670619] [2023-11-17 16:33:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:24,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:24,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:24,963 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:33:24,994 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:33:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:25,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:33:25,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:33:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:33:25,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:33:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:33:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286670619] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:33:25,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:33:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 16:33:25,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441529900] [2023-11-17 16:33:25,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:33:25,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:33:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:33:25,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:33:25,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 670 [2023-11-17 16:33:25,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 137 flow. Second operand has 12 states, 12 states have (on average 245.08333333333334) internal successors, (2941), 12 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states 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:33:25,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:25,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 670 [2023-11-17 16:33:25,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:25,648 INFO L124 PetriNetUnfolderBase]: 1970/2819 cut-off events. [2023-11-17 16:33:25,648 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2023-11-17 16:33:25,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6265 conditions, 2819 events. 1970/2819 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11192 event pairs, 808 based on Foata normal form. 0/2145 useless extension candidates. Maximal degree in co-relation 3758. Up to 1349 conditions per place. [2023-11-17 16:33:25,658 INFO L140 encePairwiseOnDemand]: 659/670 looper letters, 98 selfloop transitions, 22 changer transitions 0/120 dead transitions. [2023-11-17 16:33:25,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 120 transitions, 617 flow [2023-11-17 16:33:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:33:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:33:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2533 transitions. [2023-11-17 16:33:25,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3780597014925373 [2023-11-17 16:33:25,663 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2533 transitions. [2023-11-17 16:33:25,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2533 transitions. [2023-11-17 16:33:25,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:25,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2533 transitions. [2023-11-17 16:33:25,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 253.3) internal successors, (2533), 10 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states 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:33:25,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 670.0) internal successors, (7370), 11 states have internal predecessors, (7370), 0 states have call successors, (0), 0 states 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:33:25,677 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 670.0) internal successors, (7370), 11 states have internal predecessors, (7370), 0 states have call successors, (0), 0 states 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:33:25,677 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 137 flow. Second operand 10 states and 2533 transitions. [2023-11-17 16:33:25,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 120 transitions, 617 flow [2023-11-17 16:33:25,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 120 transitions, 607 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:33:25,680 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 292 flow [2023-11-17 16:33:25,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=292, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2023-11-17 16:33:25,681 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-11-17 16:33:25,681 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 292 flow [2023-11-17 16:33:25,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 245.08333333333334) internal successors, (2941), 12 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states 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:33:25,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:25,682 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:33:25,690 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:33:25,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:25,887 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:33:25,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1164910756, now seen corresponding path program 1 times [2023-11-17 16:33:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:25,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457953445] [2023-11-17 16:33:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:33:25,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457953445] [2023-11-17 16:33:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457953445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766383926] [2023-11-17 16:33:25,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:25,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:25,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:26,001 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:33:26,021 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:33:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:26,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:33:26,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:33:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:33:26,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:33:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:33:26,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766383926] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:33:26,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:33:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 16:33:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033953661] [2023-11-17 16:33:26,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:33:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:33:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:33:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:33:26,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 670 [2023-11-17 16:33:26,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 292 flow. Second operand has 12 states, 12 states have (on average 241.33333333333334) internal successors, (2896), 12 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states 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:33:26,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:26,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 670 [2023-11-17 16:33:26,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:26,498 INFO L124 PetriNetUnfolderBase]: 1381/1970 cut-off events. [2023-11-17 16:33:26,498 INFO L125 PetriNetUnfolderBase]: For 327/327 co-relation queries the response was YES. [2023-11-17 16:33:26,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4855 conditions, 1970 events. 1381/1970 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7120 event pairs, 859 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 4154. Up to 1681 conditions per place. [2023-11-17 16:33:26,555 INFO L140 encePairwiseOnDemand]: 659/670 looper letters, 35 selfloop transitions, 9 changer transitions 41/85 dead transitions. [2023-11-17 16:33:26,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 544 flow [2023-11-17 16:33:26,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:33:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 16:33:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2226 transitions. [2023-11-17 16:33:26,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3691542288557214 [2023-11-17 16:33:26,559 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2226 transitions. [2023-11-17 16:33:26,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2226 transitions. [2023-11-17 16:33:26,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:26,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2226 transitions. [2023-11-17 16:33:26,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 247.33333333333334) internal successors, (2226), 9 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states 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:33:26,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 670.0) internal successors, (6700), 10 states have internal predecessors, (6700), 0 states have call successors, (0), 0 states 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:33:26,569 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 670.0) internal successors, (6700), 10 states have internal predecessors, (6700), 0 states have call successors, (0), 0 states 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:33:26,569 INFO L175 Difference]: Start difference. First operand has 52 places, 57 transitions, 292 flow. Second operand 9 states and 2226 transitions. [2023-11-17 16:33:26,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 544 flow [2023-11-17 16:33:26,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 516 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 16:33:26,573 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 210 flow [2023-11-17 16:33:26,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-11-17 16:33:26,573 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2023-11-17 16:33:26,573 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 210 flow [2023-11-17 16:33:26,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 241.33333333333334) internal successors, (2896), 12 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states 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:33:26,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:26,574 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:33:26,579 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:33:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:26,779 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:33:26,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1227800752, now seen corresponding path program 2 times [2023-11-17 16:33:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776758231] [2023-11-17 16:33:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:26,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776758231] [2023-11-17 16:33:26,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776758231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19617663] [2023-11-17 16:33:26,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:33:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:26,916 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:33:26,924 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:33:27,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:33:27,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:33:27,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:33:27,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:33:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:27,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:33:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19617663] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:27,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:33:27,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-11-17 16:33:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368461674] [2023-11-17 16:33:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:33:27,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 16:33:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:27,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 16:33:27,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:33:27,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 670 [2023-11-17 16:33:27,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 242.66666666666666) internal successors, (1456), 6 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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:33:27,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:27,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 670 [2023-11-17 16:33:27,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:27,297 INFO L124 PetriNetUnfolderBase]: 1132/1564 cut-off events. [2023-11-17 16:33:27,297 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2023-11-17 16:33:27,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4108 conditions, 1564 events. 1132/1564 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5714 event pairs, 204 based on Foata normal form. 0/1234 useless extension candidates. Maximal degree in co-relation 4085. Up to 1065 conditions per place. [2023-11-17 16:33:27,305 INFO L140 encePairwiseOnDemand]: 663/670 looper letters, 52 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2023-11-17 16:33:27,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 381 flow [2023-11-17 16:33:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:33:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:33:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1481 transitions. [2023-11-17 16:33:27,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36840796019900496 [2023-11-17 16:33:27,309 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1481 transitions. [2023-11-17 16:33:27,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1481 transitions. [2023-11-17 16:33:27,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:27,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1481 transitions. [2023-11-17 16:33:27,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.83333333333334) internal successors, (1481), 6 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states 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:33:27,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 670.0) internal successors, (4690), 7 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states 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:33:27,315 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 670.0) internal successors, (4690), 7 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states 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:33:27,316 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 210 flow. Second operand 6 states and 1481 transitions. [2023-11-17 16:33:27,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 381 flow [2023-11-17 16:33:27,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 325 flow, removed 15 selfloop flow, removed 9 redundant places. [2023-11-17 16:33:27,321 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 202 flow [2023-11-17 16:33:27,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-11-17 16:33:27,323 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2023-11-17 16:33:27,324 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 202 flow [2023-11-17 16:33:27,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.66666666666666) internal successors, (1456), 6 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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:33:27,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:27,325 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:33:27,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 16:33:27,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:27,530 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:33:27,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 238164042, now seen corresponding path program 2 times [2023-11-17 16:33:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:27,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881322876] [2023-11-17 16:33:27,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:33:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881322876] [2023-11-17 16:33:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881322876] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948033248] [2023-11-17 16:33:27,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:33:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:27,670 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:33:27,697 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:33:27,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:33:27,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:33:27,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:33:27,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:33:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:27,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:33:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:27,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948033248] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:27,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:33:27,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-11-17 16:33:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944183314] [2023-11-17 16:33:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:33:27,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 16:33:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:27,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 16:33:27,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:33:27,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 670 [2023-11-17 16:33:27,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 246.83333333333334) internal successors, (1481), 6 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states 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:33:27,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:27,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 670 [2023-11-17 16:33:27,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:28,112 INFO L124 PetriNetUnfolderBase]: 1253/1711 cut-off events. [2023-11-17 16:33:28,112 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2023-11-17 16:33:28,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 1711 events. 1253/1711 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5448 event pairs, 396 based on Foata normal form. 86/1429 useless extension candidates. Maximal degree in co-relation 4262. Up to 897 conditions per place. [2023-11-17 16:33:28,120 INFO L140 encePairwiseOnDemand]: 663/670 looper letters, 60 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2023-11-17 16:33:28,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 418 flow [2023-11-17 16:33:28,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:33:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:33:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1508 transitions. [2023-11-17 16:33:28,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37512437810945276 [2023-11-17 16:33:28,124 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1508 transitions. [2023-11-17 16:33:28,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1508 transitions. [2023-11-17 16:33:28,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:28,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1508 transitions. [2023-11-17 16:33:28,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.33333333333334) internal successors, (1508), 6 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states 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:33:28,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 670.0) internal successors, (4690), 7 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states 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:33:28,141 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 670.0) internal successors, (4690), 7 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states 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:33:28,141 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 202 flow. Second operand 6 states and 1508 transitions. [2023-11-17 16:33:28,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 418 flow [2023-11-17 16:33:28,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 403 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-17 16:33:28,146 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 229 flow [2023-11-17 16:33:28,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-11-17 16:33:28,146 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2023-11-17 16:33:28,146 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 229 flow [2023-11-17 16:33:28,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.83333333333334) internal successors, (1481), 6 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states 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:33:28,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:28,147 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:33:28,155 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:33:28,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:28,353 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:33:28,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1672692011, now seen corresponding path program 1 times [2023-11-17 16:33:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:28,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364439981] [2023-11-17 16:33:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364439981] [2023-11-17 16:33:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364439981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437532662] [2023-11-17 16:33:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:28,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:28,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:33:28,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 16:33:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:28,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:33:28,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:33:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:28,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:33:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:33:28,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437532662] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:28,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:33:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-11-17 16:33:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850624932] [2023-11-17 16:33:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:33:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 16:33:28,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:28,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 16:33:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:33:28,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 670 [2023-11-17 16:33:28,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 247.16666666666666) internal successors, (1483), 6 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states 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:33:28,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:28,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 670 [2023-11-17 16:33:28,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:28,865 INFO L124 PetriNetUnfolderBase]: 1656/2252 cut-off events. [2023-11-17 16:33:28,865 INFO L125 PetriNetUnfolderBase]: For 1498/1498 co-relation queries the response was YES. [2023-11-17 16:33:28,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 2252 events. 1656/2252 cut-off events. For 1498/1498 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7834 event pairs, 734 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 6461. Up to 1709 conditions per place. [2023-11-17 16:33:28,875 INFO L140 encePairwiseOnDemand]: 665/670 looper letters, 69 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-11-17 16:33:28,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 492 flow [2023-11-17 16:33:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:33:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:33:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1509 transitions. [2023-11-17 16:33:28,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3753731343283582 [2023-11-17 16:33:28,879 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1509 transitions. [2023-11-17 16:33:28,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1509 transitions. [2023-11-17 16:33:28,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:33:28,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1509 transitions. [2023-11-17 16:33:28,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states 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:33:28,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 670.0) internal successors, (4690), 7 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states 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:33:28,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 670.0) internal successors, (4690), 7 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states 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:33:28,886 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 229 flow. Second operand 6 states and 1509 transitions. [2023-11-17 16:33:28,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 492 flow [2023-11-17 16:33:28,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 477 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 16:33:28,892 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 237 flow [2023-11-17 16:33:28,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-11-17 16:33:28,894 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2023-11-17 16:33:28,894 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 237 flow [2023-11-17 16:33:28,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.16666666666666) internal successors, (1483), 6 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states 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:33:28,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:28,895 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:33:28,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 16:33:29,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:29,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:33:29,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1452017897, now seen corresponding path program 1 times [2023-11-17 16:33:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904146783] [2023-11-17 16:33:29,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-17 16:33:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904146783] [2023-11-17 16:33:30,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904146783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:30,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811094033] [2023-11-17 16:33:30,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:30,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:30,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:30,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:33:30,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 16:33:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:30,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 16:33:30,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:33:30,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-17 16:33:30,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:33:30,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 16:33:30,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:33:30,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-17 16:33:31,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:33:31,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:33:31,303 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:33:31,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2023-11-17 16:33:31,441 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2023-11-17 16:33:31,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 42 [2023-11-17 16:33:33,351 INFO L349 Elim1Store]: treesize reduction 120, result has 78.9 percent of original size [2023-11-17 16:33:33,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 326 treesize of output 632 [2023-11-17 16:38:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-17 16:38:11,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:38:20,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (+ c_~A~0.offset 4))) (and (or (< c_~minb~0 |c_thread1Thread1of1ForFork2_#t~mem4|) (let ((.cse1 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (and (forall ((v_ArrVal_404 (Array Int Int)) (|v_thread2Thread1of1ForFork0_plus_#res#1_54| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_404))) (or (forall ((~C~0.offset Int)) (<= (+ c_~mina~0 (select (select (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) (+ ~C~0.offset 4) |v_thread2Thread1of1ForFork0_plus_#res#1_54|)) c_~B~0.base) .cse1)) c_~minc~0)) (< |v_thread2Thread1of1ForFork0_plus_#res#1_54| (+ (select (select .cse0 c_~B~0.base) .cse2) (select (select .cse0 c_~A~0.base) .cse3)))))) (forall ((v_ArrVal_404 (Array Int Int)) (|v_thread2Thread1of1ForFork0_plus_#res#1_54| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_404))) (or (< |v_thread2Thread1of1ForFork0_plus_#res#1_54| (+ (select (select .cse4 c_~B~0.base) .cse2) (select (select .cse4 c_~A~0.base) .cse3))) (forall ((~C~0.offset Int)) (<= (+ c_~mina~0 (select (select (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) (+ ~C~0.offset 4) |v_thread2Thread1of1ForFork0_plus_#res#1_54|)) c_~B~0.base) .cse1)) |v_thread2Thread1of1ForFork0_plus_#res#1_54|)))))))) (or (< |c_thread1Thread1of1ForFork2_#t~mem4| (+ c_~minb~0 1)) (let ((.cse5 (+ c_~mina~0 c_~minb~0))) (and (<= .cse5 c_~minc~0) (forall ((v_ArrVal_404 (Array Int Int))) (<= .cse5 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_404))) (+ (select (select .cse6 c_~B~0.base) .cse2) (select (select .cse6 c_~A~0.base) .cse3)))))))))) is different from false [2023-11-17 16:38:20,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:20,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 892 treesize of output 862 [2023-11-17 16:38:20,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:20,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 698 treesize of output 689 [2023-11-17 16:38:20,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:20,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 698 treesize of output 689 [2023-11-17 16:38:20,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:20,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 658 treesize of output 651 [2023-11-17 16:38:22,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:22,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-11-17 16:38:22,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-17 16:38:22,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:22,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 143 [2023-11-17 16:38:23,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:23,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:23,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-17 16:38:23,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:23,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 37 [2023-11-17 16:38:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-17 16:38:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811094033] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:38:23,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:38:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2023-11-17 16:38:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136285272] [2023-11-17 16:38:23,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:38:23,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-17 16:38:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:38:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-17 16:38:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1250, Unknown=5, NotChecked=72, Total=1482 [2023-11-17 16:38:23,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 670 [2023-11-17 16:38:23,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 237 flow. Second operand has 39 states, 39 states have (on average 210.02564102564102) internal successors, (8191), 39 states have internal predecessors, (8191), 0 states have call successors, (0), 0 states 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:38:23,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:38:23,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 670 [2023-11-17 16:38:23,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:38:28,228 INFO L124 PetriNetUnfolderBase]: 3910/5304 cut-off events. [2023-11-17 16:38:28,229 INFO L125 PetriNetUnfolderBase]: For 4066/4066 co-relation queries the response was YES. [2023-11-17 16:38:28,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16394 conditions, 5304 events. 3910/5304 cut-off events. For 4066/4066 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21313 event pairs, 134 based on Foata normal form. 3/4158 useless extension candidates. Maximal degree in co-relation 16354. Up to 2012 conditions per place. [2023-11-17 16:38:28,255 INFO L140 encePairwiseOnDemand]: 652/670 looper letters, 205 selfloop transitions, 75 changer transitions 3/283 dead transitions. [2023-11-17 16:38:28,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 283 transitions, 1736 flow [2023-11-17 16:38:28,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:38:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-17 16:38:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4627 transitions. [2023-11-17 16:38:28,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3288557213930348 [2023-11-17 16:38:28,268 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4627 transitions. [2023-11-17 16:38:28,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4627 transitions. [2023-11-17 16:38:28,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:38:28,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4627 transitions. [2023-11-17 16:38:28,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 220.33333333333334) internal successors, (4627), 21 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states 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:38:28,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 670.0) internal successors, (14740), 22 states have internal predecessors, (14740), 0 states have call successors, (0), 0 states 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:38:28,291 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 670.0) internal successors, (14740), 22 states have internal predecessors, (14740), 0 states have call successors, (0), 0 states 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:38:28,291 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 237 flow. Second operand 21 states and 4627 transitions. [2023-11-17 16:38:28,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 283 transitions, 1736 flow [2023-11-17 16:38:28,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 283 transitions, 1699 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-17 16:38:28,304 INFO L231 Difference]: Finished difference. Result has 83 places, 122 transitions, 881 flow [2023-11-17 16:38:28,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=670, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=881, PETRI_PLACES=83, PETRI_TRANSITIONS=122} [2023-11-17 16:38:28,304 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 46 predicate places. [2023-11-17 16:38:28,305 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 122 transitions, 881 flow [2023-11-17 16:38:28,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 210.02564102564102) internal successors, (8191), 39 states have internal predecessors, (8191), 0 states have call successors, (0), 0 states 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:38:28,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:38:28,307 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:38:28,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 16:38:28,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:38:28,514 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:38:28,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:38:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash 791907897, now seen corresponding path program 2 times [2023-11-17 16:38:28,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:38:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938261168] [2023-11-17 16:38:28,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:38:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:38:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:38:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-17 16:38:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:38:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938261168] [2023-11-17 16:38:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938261168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:38:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820918894] [2023-11-17 16:38:29,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:38:29,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:38:29,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:38:29,640 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:38:29,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 16:38:29,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:38:29,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:38:29,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-17 16:38:29,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:38:29,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 16:38:29,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-17 16:38:29,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-17 16:38:29,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-17 16:38:29,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-17 16:38:29,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-17 16:38:29,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-17 16:38:29,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-17 16:38:29,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-17 16:38:29,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-17 16:38:29,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-17 16:38:29,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-17 16:38:29,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-17 16:38:29,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-17 16:38:29,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:38:29,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-17 16:38:29,937 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-17 16:38:29,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-17 16:38:29,998 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-17 16:38:29,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-17 16:38:30,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-17 16:38:30,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-11-17 16:38:30,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:30,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 182 [2023-11-17 16:38:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-17 16:38:31,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:38:32,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:32,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 299 treesize of output 303 [2023-11-17 16:38:32,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:32,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2023-11-17 16:38:32,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:32,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 163 [2023-11-17 16:38:32,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:32,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 111 [2023-11-17 16:38:32,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-17 16:38:32,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-17 16:38:32,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:32,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 100 [2023-11-17 16:38:33,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:33,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 307 treesize of output 359 [2023-11-17 16:38:37,497 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 16:38:37,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-17 16:38:37,500 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 16:38:37,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-17 16:38:37,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:38:37,707 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:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-11-17 16:38:37,710 INFO L158 Benchmark]: Toolchain (without parser) took 322430.39ms. Allocated memory was 357.6MB in the beginning and 1.1GB in the end (delta: 715.1MB). Free memory was 305.8MB in the beginning and 812.6MB in the end (delta: -506.9MB). Peak memory consumption was 643.6MB. Max. memory is 8.0GB. [2023-11-17 16:38:37,710 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:38:37,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.89ms. Allocated memory is still 357.6MB. Free memory was 305.3MB in the beginning and 293.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:38:37,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.09ms. Allocated memory is still 357.6MB. Free memory was 293.2MB in the beginning and 290.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 16:38:37,710 INFO L158 Benchmark]: Boogie Preprocessor took 51.91ms. Allocated memory is still 357.6MB. Free memory was 290.6MB in the beginning and 288.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:38:37,710 INFO L158 Benchmark]: RCFGBuilder took 619.77ms. Allocated memory is still 357.6MB. Free memory was 288.0MB in the beginning and 252.8MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-11-17 16:38:37,711 INFO L158 Benchmark]: TraceAbstraction took 321494.05ms. Allocated memory was 357.6MB in the beginning and 1.1GB in the end (delta: 715.1MB). Free memory was 252.3MB in the beginning and 812.6MB in the end (delta: -560.3MB). Peak memory consumption was 590.1MB. Max. memory is 8.0GB. [2023-11-17 16:38:37,711 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.89ms. Allocated memory is still 357.6MB. Free memory was 305.3MB in the beginning and 293.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.09ms. Allocated memory is still 357.6MB. Free memory was 293.2MB in the beginning and 290.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.91ms. Allocated memory is still 357.6MB. Free memory was 290.6MB in the beginning and 288.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 619.77ms. Allocated memory is still 357.6MB. Free memory was 288.0MB in the beginning and 252.8MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 321494.05ms. Allocated memory was 357.6MB in the beginning and 1.1GB in the end (delta: 715.1MB). Free memory was 252.3MB in the beginning and 812.6MB in the end (delta: -560.3MB). Peak memory consumption was 590.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 293 PlacesBefore, 37 PlacesAfterwards, 310 TransitionsBefore, 35 TransitionsAfterwards, 3186 CoEnabledTransitionPairs, 7 FixpointIterations, 209 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 63 TrivialYvCompositions, 14 ConcurrentYvCompositions, 19 ChoiceCompositions, 346 TotalNumberOfCompositions, 4431 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3335, independent: 3233, independent conditional: 0, independent unconditional: 3233, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2265, independent: 2230, independent conditional: 0, independent unconditional: 2230, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2265, independent: 2230, independent conditional: 0, independent unconditional: 2230, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3335, independent: 1003, independent conditional: 0, independent unconditional: 1003, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 2265, unknown conditional: 0, unknown unconditional: 2265] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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...