/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:29:13,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:29:13,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:29:13,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:29:13,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:29:13,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:29:13,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:29:13,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:29:13,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:29:13,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:29:13,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:29:13,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:29:13,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:29:13,159 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:29:13,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:29:13,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:29:13,160 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:29:13,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:29:13,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:29:13,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:29:13,161 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:29:13,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:29:13,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:29:13,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:29:13,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:29:13,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:29:13,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:29:13,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:29:13,162 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:29:13,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:29:13,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:29:13,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:29:13,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:29:13,163 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:29:13,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:29:13,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:29:13,164 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:29:13,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:29:13,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:29:13,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:29:13,164 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:29:13,164 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/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 16:29:13,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:29:13,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:29:13,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:29:13,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:29:13,371 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:29:13,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2024-05-30 16:29:14,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:29:14,630 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:29:14,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2024-05-30 16:29:14,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/016524237/9fb4d70a821d4220979053373c08b4d2/FLAG977fc432c [2024-05-30 16:29:14,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/016524237/9fb4d70a821d4220979053373c08b4d2 [2024-05-30 16:29:14,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:29:14,650 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:29:14,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:29:14,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:29:14,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:29:14,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47449d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14, skipping insertion in model container [2024-05-30 16:29:14,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,676 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:29:14,805 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c[2087,2100] [2024-05-30 16:29:14,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:29:14,815 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:29:14,827 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c[2087,2100] [2024-05-30 16:29:14,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:29:14,838 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:29:14,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14 WrapperNode [2024-05-30 16:29:14,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:29:14,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:29:14,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:29:14,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:29:14,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,862 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2024-05-30 16:29:14,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:29:14,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:29:14,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:29:14,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:29:14,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:29:14,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:29:14,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:29:14,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:29:14,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (1/1) ... [2024-05-30 16:29:14,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:29:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:14,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 16:29:14,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 16:29:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:29:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:29:14,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:29:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:29:14,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:29:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:29:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:29:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:29:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:29:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:29:14,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:29:14,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:29:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:29:14,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:29:14,964 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 16:29:15,045 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:29:15,046 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:29:15,174 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:29:15,218 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:29:15,219 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 16:29:15,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:29:15 BoogieIcfgContainer [2024-05-30 16:29:15,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:29:15,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:29:15,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:29:15,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:29:15,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:29:14" (1/3) ... [2024-05-30 16:29:15,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:29:15, skipping insertion in model container [2024-05-30 16:29:15,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:29:14" (2/3) ... [2024-05-30 16:29:15,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:29:15, skipping insertion in model container [2024-05-30 16:29:15,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:29:15" (3/3) ... [2024-05-30 16:29:15,233 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2024-05-30 16:29:15,239 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:29:15,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:29:15,250 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:29:15,250 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:29:15,300 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 16:29:15,331 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:29:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:29:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:15,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:29:15,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 16:29:15,379 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:29:15,386 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:29:15,391 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@14e13fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:29:15,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:29:15,396 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:15,498 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,499 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,499 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,516 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,517 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,517 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,528 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,529 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,529 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,540 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,540 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,540 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,545 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 128 states. [2024-05-30 16:29:15,545 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:29:15,548 INFO L78 Accepts]: Start accepts. Automaton has currently 137 states, but on-demand construction may add more states Word has length 64 [2024-05-30 16:29:15,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:15,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:15,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1144373803, now seen corresponding path program 1 times [2024-05-30 16:29:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156660336] [2024-05-30 16:29:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:15,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156660336] [2024-05-30 16:29:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156660336] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:29:15,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:29:15,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:29:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996401056] [2024-05-30 16:29:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:29:15,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:29:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:29:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:29:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:15,789 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:15,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:15,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:15,791 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:15,811 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,811 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,811 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,819 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,819 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,819 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,826 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,826 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,826 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,834 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:15,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:15,835 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:15,841 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 136 states. [2024-05-30 16:29:15,841 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:29:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:15,841 INFO L78 Accepts]: Start accepts. Automaton has currently 145 states, but on-demand construction may add more states Word has length 62 [2024-05-30 16:29:15,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:15,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:29:15,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:15,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash -332283311, now seen corresponding path program 1 times [2024-05-30 16:29:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309161558] [2024-05-30 16:29:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309161558] [2024-05-30 16:29:16,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309161558] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:29:16,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:29:16,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-30 16:29:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122674800] [2024-05-30 16:29:16,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:29:16,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-30 16:29:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:16,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-30 16:29:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-05-30 16:29:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:16,602 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:16,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:16,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:16,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:16,603 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:16,804 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:16,804 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:16,804 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:16,837 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 114 states. [2024-05-30 16:29:16,837 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:29:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:16,838 INFO L78 Accepts]: Start accepts. Automaton has currently 123 states, but on-demand construction may add more states Word has length 67 [2024-05-30 16:29:16,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:16,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:29:16,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:16,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash 233227766, now seen corresponding path program 1 times [2024-05-30 16:29:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631873905] [2024-05-30 16:29:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:17,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:17,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631873905] [2024-05-30 16:29:17,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631873905] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:17,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413438030] [2024-05-30 16:29:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:17,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:17,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:17,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 16:29:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:17,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2024-05-30 16:29:17,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:17,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413438030] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:18,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 35 [2024-05-30 16:29:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114093432] [2024-05-30 16:29:18,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:18,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-30 16:29:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:18,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-30 16:29:18,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2024-05-30 16:29:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:18,298 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:18,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:18,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:18,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:18,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:18,299 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:18,651 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:18,652 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:18,652 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:18,689 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 131 states. [2024-05-30 16:29:18,689 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:29:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:29:18,690 INFO L78 Accepts]: Start accepts. Automaton has currently 140 states, but on-demand construction may add more states Word has length 72 [2024-05-30 16:29:18,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:18,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 16:29:18,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 16:29:18,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:18,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -311737999, now seen corresponding path program 2 times [2024-05-30 16:29:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454287884] [2024-05-30 16:29:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454287884] [2024-05-30 16:29:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454287884] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:19,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310349407] [2024-05-30 16:29:19,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:29:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:19,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:19,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 16:29:19,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:29:19,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:29:19,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-30 16:29:19,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:19,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310349407] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:20,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 46 [2024-05-30 16:29:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394919909] [2024-05-30 16:29:20,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-30 16:29:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-30 16:29:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2024-05-30 16:29:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:20,327 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:20,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 46 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:20,328 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:20,998 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 136 states. [2024-05-30 16:29:20,998 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:29:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:29:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-30 16:29:20,999 INFO L78 Accepts]: Start accepts. Automaton has currently 137 states, but on-demand construction may add more states Word has length 82 [2024-05-30 16:29:21,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:21,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 16:29:21,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:21,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:21,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1935124335, now seen corresponding path program 3 times [2024-05-30 16:29:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564459006] [2024-05-30 16:29:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-30 16:29:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:21,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564459006] [2024-05-30 16:29:21,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564459006] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91014332] [2024-05-30 16:29:21,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:29:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:21,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:21,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:21,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 16:29:21,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-30 16:29:21,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:29:21,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-30 16:29:21,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:22,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91014332] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:23,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 60 [2024-05-30 16:29:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978358230] [2024-05-30 16:29:23,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-05-30 16:29:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-05-30 16:29:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=3218, Unknown=0, NotChecked=0, Total=3540 [2024-05-30 16:29:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:23,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:23,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.0) internal successors, (180), 60 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:23,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:23,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:23,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:29:23,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-30 16:29:23,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:23,257 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:24,716 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:24,716 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:24,716 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:25,242 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 193 states. [2024-05-30 16:29:25,242 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:29:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:29:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:29:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-30 16:29:25,243 INFO L78 Accepts]: Start accepts. Automaton has currently 208 states, but on-demand construction may add more states Word has length 102 [2024-05-30 16:29:25,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:25,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-30 16:29:25,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:25,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:25,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1064639601, now seen corresponding path program 1 times [2024-05-30 16:29:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400615755] [2024-05-30 16:29:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-05-30 16:29:25,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400615755] [2024-05-30 16:29:25,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400615755] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033447483] [2024-05-30 16:29:25,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:25,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:25,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:25,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:25,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 16:29:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:26,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 59 conjunts are in the unsatisfiable core [2024-05-30 16:29:26,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:26,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-05-30 16:29:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033447483] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:27,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:27,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35, 21] total 62 [2024-05-30 16:29:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268648904] [2024-05-30 16:29:27,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:27,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-05-30 16:29:27,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-05-30 16:29:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3549, Unknown=0, NotChecked=0, Total=3782 [2024-05-30 16:29:27,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:27,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:27,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 62 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:27,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:27,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:27,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:29:27,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:29:27,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-30 16:29:27,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:27,160 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:28,546 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:28,546 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:28,546 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:29:29,004 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:29,005 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:29,005 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,007 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:29,007 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,007 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,255 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:29,256 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,256 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,264 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:29,265 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,265 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,404 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:29,405 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,405 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,434 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:29,434 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,435 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,447 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:29,447 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:29,447 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:30,180 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,180 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,524 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:30,524 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,524 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,620 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:30,620 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,620 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,808 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:30,809 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,809 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,915 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:30,915 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,915 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,918 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:30,918 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:30,918 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,929 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:30,930 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,930 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:30,953 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 548 states. [2024-05-30 16:29:30,954 INFO L212 cStratifiedReduction]: Copied states 37 times. [2024-05-30 16:29:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:30,954 INFO L78 Accepts]: Start accepts. Automaton has currently 561 states, but on-demand construction may add more states Word has length 107 [2024-05-30 16:29:30,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:30,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-30 16:29:31,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-30 16:29:31,156 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:31,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1110335907, now seen corresponding path program 2 times [2024-05-30 16:29:31,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:31,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853347883] [2024-05-30 16:29:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:31,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-30 16:29:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:31,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853347883] [2024-05-30 16:29:31,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853347883] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:31,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136272769] [2024-05-30 16:29:31,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:29:31,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:31,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:31,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 16:29:31,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:29:31,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:29:31,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 65 conjunts are in the unsatisfiable core [2024-05-30 16:29:31,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:32,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-30 16:29:32,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136272769] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:32,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:32,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 37, 18] total 60 [2024-05-30 16:29:32,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809630010] [2024-05-30 16:29:32,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:32,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-05-30 16:29:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-05-30 16:29:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3283, Unknown=0, NotChecked=0, Total=3540 [2024-05-30 16:29:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:32,885 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:32,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.6333333333333333) internal successors, (158), 60 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:32,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:32,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:32,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:32,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:32,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:32,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:32,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:32,886 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:34,459 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,459 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:34,459 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,464 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,465 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,465 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,519 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,519 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:34,519 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,520 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,520 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,527 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,527 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,527 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,533 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,533 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,533 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,553 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,553 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,553 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,558 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,558 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,558 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,565 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,565 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,565 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,600 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,600 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,600 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,688 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,688 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,688 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,737 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,737 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,737 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,842 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,842 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,842 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,912 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,913 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,913 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:34,914 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:34,915 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:34,915 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:35,089 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:35,089 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:35,089 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:35,092 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 578 states. [2024-05-30 16:29:35,093 INFO L212 cStratifiedReduction]: Copied states 45 times. [2024-05-30 16:29:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:35,093 INFO L78 Accepts]: Start accepts. Automaton has currently 598 states, but on-demand construction may add more states Word has length 117 [2024-05-30 16:29:35,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:35,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-30 16:29:35,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:35,299 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:35,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash -900438721, now seen corresponding path program 3 times [2024-05-30 16:29:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:35,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573144858] [2024-05-30 16:29:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-05-30 16:29:35,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573144858] [2024-05-30 16:29:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573144858] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521227249] [2024-05-30 16:29:35,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:29:35,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:35,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:35,883 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:35,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 16:29:35,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-05-30 16:29:35,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:29:35,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 77 conjunts are in the unsatisfiable core [2024-05-30 16:29:35,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:36,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-05-30 16:29:37,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521227249] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:37,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:37,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 43, 20] total 69 [2024-05-30 16:29:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563822207] [2024-05-30 16:29:37,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:37,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-05-30 16:29:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:37,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-05-30 16:29:37,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4414, Unknown=0, NotChecked=0, Total=4692 [2024-05-30 16:29:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:37,409 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:37,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.550724637681159) internal successors, (176), 69 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:37,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:37,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:37,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:37,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:37,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:37,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:37,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:37,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:37,410 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:39,295 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,295 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:39,295 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,298 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,298 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,298 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,363 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,364 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:39,364 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,364 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,364 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,365 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,368 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,369 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,369 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,373 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,373 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,373 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,394 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,397 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,398 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,398 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,402 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,403 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,403 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,427 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,427 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,427 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,608 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,609 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,609 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,733 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,733 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,734 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,902 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,902 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,902 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,959 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,959 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,960 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:39,961 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:39,961 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:39,961 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:40,235 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 594 states. [2024-05-30 16:29:40,235 INFO L212 cStratifiedReduction]: Copied states 38 times. [2024-05-30 16:29:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:29:40,236 INFO L78 Accepts]: Start accepts. Automaton has currently 629 states, but on-demand construction may add more states Word has length 132 [2024-05-30 16:29:40,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:40,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 16:29:40,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-30 16:29:40,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:40,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1383292223, now seen corresponding path program 4 times [2024-05-30 16:29:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674589640] [2024-05-30 16:29:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-05-30 16:29:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674589640] [2024-05-30 16:29:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674589640] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237079746] [2024-05-30 16:29:41,090 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:29:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:41,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:41,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-30 16:29:41,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:29:41,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:29:41,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 95 conjunts are in the unsatisfiable core [2024-05-30 16:29:41,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:42,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-05-30 16:29:42,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237079746] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:42,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:42,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 51, 22] total 82 [2024-05-30 16:29:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938372267] [2024-05-30 16:29:42,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:42,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-05-30 16:29:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-05-30 16:29:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=6319, Unknown=0, NotChecked=0, Total=6642 [2024-05-30 16:29:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:42,707 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:42,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.475609756097561) internal successors, (203), 82 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:29:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:42,708 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:44,321 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,321 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:44,321 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,325 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,325 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,325 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,393 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,393 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:44,393 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,394 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,399 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,399 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,399 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,403 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,403 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,403 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,429 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,429 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,429 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,435 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,435 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,435 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,440 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,440 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,440 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,468 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,468 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,468 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,661 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,662 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,662 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,789 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,790 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,790 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,968 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:44,968 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:44,968 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:45,041 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:45,042 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:45,042 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:45,043 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:45,043 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:45,043 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:45,765 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 631 states. [2024-05-30 16:29:45,765 INFO L212 cStratifiedReduction]: Copied states 36 times. [2024-05-30 16:29:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:29:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-05-30 16:29:45,766 INFO L78 Accepts]: Start accepts. Automaton has currently 672 states, but on-demand construction may add more states Word has length 152 [2024-05-30 16:29:45,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:45,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-30 16:29:45,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:45,972 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:45,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash -961913142, now seen corresponding path program 5 times [2024-05-30 16:29:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861909405] [2024-05-30 16:29:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-05-30 16:29:46,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861909405] [2024-05-30 16:29:46,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861909405] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:46,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58503126] [2024-05-30 16:29:46,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:29:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:46,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:46,869 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:46,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 16:29:46,944 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-05-30 16:29:46,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:29:46,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 119 conjunts are in the unsatisfiable core [2024-05-30 16:29:46,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:48,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-05-30 16:29:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58503126] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:49,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:49,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 62, 23] total 94 [2024-05-30 16:29:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562300679] [2024-05-30 16:29:49,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:49,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-05-30 16:29:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-05-30 16:29:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=8384, Unknown=0, NotChecked=0, Total=8742 [2024-05-30 16:29:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:49,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:49,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 2.4468085106382977) internal successors, (230), 94 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-05-30 16:29:49,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:49,026 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:29:51,544 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,545 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:51,545 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,547 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,547 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,547 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,618 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,618 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:51,619 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,619 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,619 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,619 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,625 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,625 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,625 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,663 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,664 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,664 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,708 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,709 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,709 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,713 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,719 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,719 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,720 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,757 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:51,757 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:51,757 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,164 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:52,164 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,165 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,313 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:52,313 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,313 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,462 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:52,463 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,463 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,525 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:52,525 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,525 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:52,527 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:29:52,527 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:29:52,527 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:29:53,272 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 654 states. [2024-05-30 16:29:53,272 INFO L212 cStratifiedReduction]: Copied states 32 times. [2024-05-30 16:29:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:29:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-05-30 16:29:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-05-30 16:29:53,273 INFO L78 Accepts]: Start accepts. Automaton has currently 713 states, but on-demand construction may add more states Word has length 162 [2024-05-30 16:29:53,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:29:53,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-30 16:29:53,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-30 16:29:53,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:29:53,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:29:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1039978399, now seen corresponding path program 6 times [2024-05-30 16:29:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:29:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779594341] [2024-05-30 16:29:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:29:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:29:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:29:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-05-30 16:29:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:29:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779594341] [2024-05-30 16:29:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779594341] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:29:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642409637] [2024-05-30 16:29:54,548 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:29:54,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:29:54,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:29:54,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-30 16:29:54,645 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2024-05-30 16:29:54,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:29:54,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 131 conjunts are in the unsatisfiable core [2024-05-30 16:29:54,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:29:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:29:56,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:29:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-05-30 16:29:57,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642409637] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:29:57,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:29:57,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 68, 24] total 99 [2024-05-30 16:29:57,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934800742] [2024-05-30 16:29:57,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:29:57,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2024-05-30 16:29:57,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:29:57,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2024-05-30 16:29:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=9364, Unknown=0, NotChecked=0, Total=9702 [2024-05-30 16:29:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:57,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:29:57,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 2.313131313131313) internal successors, (229), 99 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2024-05-30 16:29:57,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:29:57,302 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:00,389 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,389 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:00,389 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,391 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,391 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,391 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,481 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,481 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:00,481 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,482 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,482 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,482 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,486 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,486 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,486 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,491 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,491 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,491 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,524 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,524 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,524 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,528 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,528 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,528 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,533 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,533 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,533 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,590 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:00,590 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:00,590 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,024 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:01,024 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,024 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,225 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:01,225 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,225 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,437 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:01,438 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,438 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,538 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:01,538 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,538 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:01,540 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:01,540 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:01,540 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,738 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:02,738 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,738 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,805 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:02,805 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,805 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,810 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:02,810 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,810 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,894 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:02,894 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,894 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,908 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:02,908 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,908 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,914 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:02,914 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:02,914 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,481 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:03,481 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,481 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,544 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:03,544 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,544 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,677 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:03,677 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,677 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,678 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:03,678 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,678 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,970 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:03,970 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:03,970 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:04,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:04,129 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:04,129 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:05,089 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:05,090 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:05,090 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:05,165 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1037 states. [2024-05-30 16:30:05,166 INFO L212 cStratifiedReduction]: Copied states 42 times. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2024-05-30 16:30:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2024-05-30 16:30:05,166 INFO L78 Accepts]: Start accepts. Automaton has currently 1102 states, but on-demand construction may add more states Word has length 137 [2024-05-30 16:30:05,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:05,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-30 16:30:05,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-05-30 16:30:05,373 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:05,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash 673257240, now seen corresponding path program 7 times [2024-05-30 16:30:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:05,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784789766] [2024-05-30 16:30:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-30 16:30:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784789766] [2024-05-30 16:30:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784789766] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410541164] [2024-05-30 16:30:06,011 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:30:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:06,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:30:06,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-30 16:30:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:06,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 101 conjunts are in the unsatisfiable core [2024-05-30 16:30:06,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:30:07,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-05-30 16:30:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410541164] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:07,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 55, 21] total 82 [2024-05-30 16:30:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276833406] [2024-05-30 16:30:07,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:07,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-05-30 16:30:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-05-30 16:30:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=6344, Unknown=0, NotChecked=0, Total=6642 [2024-05-30 16:30:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:07,937 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:07,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.402439024390244) internal successors, (197), 82 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:30:07,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:07,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2024-05-30 16:30:07,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:07,938 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:10,311 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,311 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:10,312 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,314 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,314 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,314 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,393 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:10,394 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,394 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,399 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,399 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,399 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,402 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,402 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,402 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,419 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,420 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,420 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,423 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,423 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,425 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,429 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,429 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,429 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,457 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,458 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,458 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,543 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,604 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,605 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,605 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,697 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,697 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,697 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,760 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,761 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,761 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,762 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,762 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:10,762 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,913 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,913 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,914 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,916 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,916 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,924 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,927 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,927 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,927 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,930 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,930 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,930 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,945 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,945 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,946 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,949 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,949 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,949 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,952 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:10,952 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:10,952 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,023 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,023 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,023 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,029 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,030 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,030 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,030 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,030 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,044 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,045 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,045 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,052 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,053 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,053 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,065 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,066 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,066 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,559 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,560 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,560 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,758 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,758 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,758 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,763 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,764 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,764 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,859 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,859 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,859 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,892 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,893 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,893 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,898 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,899 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,899 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,971 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:11,971 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:11,971 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:12,400 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:12,400 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:12,400 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:12,403 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1311 states. [2024-05-30 16:30:12,403 INFO L212 cStratifiedReduction]: Copied states 48 times. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2024-05-30 16:30:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-05-30 16:30:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-05-30 16:30:12,404 INFO L78 Accepts]: Start accepts. Automaton has currently 1379 states, but on-demand construction may add more states Word has length 142 [2024-05-30 16:30:12,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:12,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-30 16:30:12,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:12,610 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:12,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash 838693665, now seen corresponding path program 8 times [2024-05-30 16:30:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:12,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379824594] [2024-05-30 16:30:12,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:12,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-05-30 16:30:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379824594] [2024-05-30 16:30:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379824594] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058791695] [2024-05-30 16:30:13,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:30:13,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:13,252 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:30:13,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-30 16:30:13,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:30:13,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:30:13,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 107 conjunts are in the unsatisfiable core [2024-05-30 16:30:13,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:30:14,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-05-30 16:30:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058791695] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:15,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:15,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 58, 20] total 86 [2024-05-30 16:30:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175010782] [2024-05-30 16:30:15,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:15,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-05-30 16:30:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-05-30 16:30:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=6973, Unknown=0, NotChecked=0, Total=7310 [2024-05-30 16:30:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:15,415 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:15,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.36046511627907) internal successors, (203), 86 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:30:15,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:15,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 148 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 169 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 149 states. [2024-05-30 16:30:15,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:15,416 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:19,279 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,280 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:19,280 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,282 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,282 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,282 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,426 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,426 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:19,426 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,427 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,427 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,427 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,431 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,431 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,431 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,434 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,434 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,434 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,457 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,457 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,457 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,461 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,461 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,461 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,465 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,465 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,465 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,512 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,512 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,512 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,586 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,587 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,587 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,658 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,659 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,659 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,809 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,809 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,809 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,905 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,905 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,905 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:19,908 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:19,908 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:19,908 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,126 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,127 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,127 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,129 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,129 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,131 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,132 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,132 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,134 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,134 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,134 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,136 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,137 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,137 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,140 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,140 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,140 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,142 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,142 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,142 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,145 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,145 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,145 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,150 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,150 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,150 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,151 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,151 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,151 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,160 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,160 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,160 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,167 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,167 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,167 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,179 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,179 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,350 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,351 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,351 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,467 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,468 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,468 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,471 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,471 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,471 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,497 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,497 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,497 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,520 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,520 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,524 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,524 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,524 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,544 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,544 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,544 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,666 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:20,666 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,666 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:20,669 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1335 states. [2024-05-30 16:30:20,670 INFO L212 cStratifiedReduction]: Copied states 48 times. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-05-30 16:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-05-30 16:30:20,670 INFO L78 Accepts]: Start accepts. Automaton has currently 1410 states, but on-demand construction may add more states Word has length 152 [2024-05-30 16:30:20,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:30:20,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-30 16:30:20,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-30 16:30:20,877 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:30:20,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:30:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1030527018, now seen corresponding path program 9 times [2024-05-30 16:30:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:30:20,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521452250] [2024-05-30 16:30:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:30:20,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:30:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:30:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-05-30 16:30:21,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:30:21,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521452250] [2024-05-30 16:30:21,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521452250] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:30:21,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487444743] [2024-05-30 16:30:21,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:30:21,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:30:21,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:30:21,665 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:30:21,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-30 16:30:21,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-05-30 16:30:21,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:30:21,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 119 conjunts are in the unsatisfiable core [2024-05-30 16:30:21,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:30:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:30:23,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:30:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-05-30 16:30:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487444743] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:30:24,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:30:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 64, 22] total 93 [2024-05-30 16:30:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47177826] [2024-05-30 16:30:24,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:30:24,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2024-05-30 16:30:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:30:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2024-05-30 16:30:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=8220, Unknown=0, NotChecked=0, Total=8556 [2024-05-30 16:30:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:24,539 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:30:24,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 2.2795698924731185) internal successors, (212), 93 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 148 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 169 states. [2024-05-30 16:30:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 149 states. [2024-05-30 16:30:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 162 states. [2024-05-30 16:30:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:30:24,541 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:30:28,863 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,864 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:28,864 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,866 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,866 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,866 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,968 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,968 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:28,968 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,969 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,969 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,969 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,974 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,974 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,974 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,978 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,978 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,978 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,995 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,995 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,995 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,999 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:28,999 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:28,999 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,005 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,005 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,005 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,051 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,051 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,051 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,127 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,127 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,127 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,193 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,193 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,193 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,345 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,346 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,346 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,443 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,444 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,444 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,446 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,446 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:30:29,446 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,646 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,647 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,647 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,650 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,650 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,650 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,653 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,653 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,653 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,657 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,659 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,660 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,660 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,664 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,664 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,664 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,667 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,667 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,667 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,671 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,671 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,671 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,677 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,677 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,677 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,678 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,678 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,679 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,690 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,691 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,691 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,700 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,701 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,701 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,716 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:29,717 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:29,717 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,044 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,044 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,044 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,048 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,048 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,048 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,051 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,052 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,052 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,124 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,124 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,124 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,128 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,128 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,128 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,132 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,132 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,132 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,187 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,187 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,187 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,276 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,276 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,276 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,281 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,281 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,281 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,283 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,283 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,283 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,286 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,286 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,286 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,289 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,289 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,289 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,291 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,291 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,291 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,295 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,295 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,295 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,297 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,298 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,298 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,521 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,521 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,521 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,526 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:30,526 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:30,526 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:41,591 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:41,591 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:41,591 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:44,966 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:44,966 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:44,966 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:46,821 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:46,822 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:46,822 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:49,602 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:49,603 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:49,603 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:50,486 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:50,486 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:50,486 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:53,217 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:53,217 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:53,217 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:54,125 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:54,125 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:54,125 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:56,893 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:30:56,893 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:30:56,893 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,847 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:05,847 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,847 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,851 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:05,851 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,851 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,883 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:05,883 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,883 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,895 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:05,895 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,895 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,903 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:05,903 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:05,903 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:06,053 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:06,053 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:06,054 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:06,948 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:06,948 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:06,948 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,400 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:10,401 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,401 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,406 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:10,406 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,406 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,425 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:10,425 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,425 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,462 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:10,462 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,462 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,469 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:10,470 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,470 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,863 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:10,863 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:10,863 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,195 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,195 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:20,195 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,197 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,197 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,197 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,333 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,333 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,333 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,341 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,342 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,342 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,368 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,368 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,368 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,383 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,384 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,384 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,394 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,937 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:20,937 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:20,937 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,830 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,831 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,831 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,836 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,836 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,836 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,842 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,842 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,842 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,852 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,852 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,852 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,859 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,859 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,860 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,863 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,864 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,864 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,868 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,868 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,868 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,872 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,872 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,872 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,878 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,878 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,878 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,880 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,880 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,880 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,893 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,893 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,893 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,906 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,906 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,906 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,935 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,936 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,936 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,951 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,952 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,952 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,957 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,957 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,957 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,962 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,963 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,963 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,970 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:35,970 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:35,970 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,000 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,000 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,000 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,008 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,008 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,008 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,012 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,012 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,012 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,018 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,019 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,019 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,023 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,024 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,024 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,048 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,048 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,048 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,061 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,061 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,061 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,068 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,068 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,068 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,076 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,076 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,076 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,087 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,087 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,087 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,123 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:36,123 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:36,123 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,420 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:37,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,421 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,430 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:37,430 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,430 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,441 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:37,441 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,441 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,461 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:37,462 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:37,462 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,041 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,042 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,042 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,047 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,047 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,047 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,054 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,054 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,055 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,067 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,067 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,067 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,075 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,075 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,075 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,080 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,080 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,080 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,085 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,085 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,085 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,089 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,089 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,089 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,096 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,096 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,096 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,097 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,098 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,098 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,113 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,113 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,113 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,128 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,128 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,128 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,169 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,169 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,169 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,186 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,187 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,187 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,193 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,194 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,194 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,200 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,200 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,200 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,208 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,209 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,209 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,242 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,242 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,242 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,250 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,250 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,250 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,255 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,255 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,256 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,263 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,263 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,263 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,269 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,269 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,269 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,292 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,293 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,293 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,304 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,304 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,305 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,310 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,310 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,310 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,317 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,317 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,317 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,328 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,328 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,328 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,363 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:38,363 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:38,363 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,563 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,564 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,564 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,572 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,572 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,572 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,583 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,583 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,583 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,598 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,598 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,598 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,931 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,931 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,932 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,938 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,938 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,938 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,944 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,944 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,944 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,956 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,956 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,956 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,963 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,964 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,964 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,968 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,968 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,968 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,973 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,973 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,973 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,977 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,977 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,977 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,984 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,984 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,984 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,986 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:39,986 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:39,986 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,001 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,001 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,001 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,017 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,017 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,017 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,050 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,050 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,050 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,066 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,066 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,066 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,072 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,073 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,073 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,079 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,079 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,079 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,086 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,086 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,086 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,120 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,121 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,121 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,129 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,129 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,134 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,134 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,134 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,141 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,141 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,141 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,146 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,146 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,173 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,173 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,173 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,187 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,187 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,187 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,194 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,195 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,195 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,203 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,203 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,203 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,215 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,215 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,215 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,257 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:40,258 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:40,258 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:41,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,543 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,553 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:41,553 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,553 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,566 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:41,566 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,566 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,583 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:41,584 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:41,584 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:46,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,394 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,715 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:46,715 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,715 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,855 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:46,855 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,855 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,995 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:46,995 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:46,995 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:47,136 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,136 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:47,136 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:47,269 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,269 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:47,269 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-30 16:31:47,301 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 15515 states. [2024-05-30 16:31:47,301 INFO L212 cStratifiedReduction]: Copied states 387 times. [2024-05-30 16:31:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:31:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 16:31:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-30 16:31:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 346 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 387 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 293 states. [2024-05-30 16:31:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2024-05-30 16:31:47,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:31:47,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-05-30 16:31:47,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-30 16:31:47,548 INFO L445 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1] [2024-05-30 16:31:47,549 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-05-30 16:31:47,551 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:31:47,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:31:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:47,552 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:31:47,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-05-30 16:31:47,572 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:31:47,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 16:31:47,573 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@14e13fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:31:47,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:31:47,573 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:47,585 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,585 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:47,585 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:31:47,589 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:47,589 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:31:47,591 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,591 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:47,591 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:31:47,593 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,593 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:47,593 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:31:47,594 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,594 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:47,594 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:31:47,595 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:31:47,595 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:31:47,596 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:31:47,596 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 91 states. [2024-05-30 16:31:47,596 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:31:47,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 16:31:47,597 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 16:31:47,597 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-05-30 16:31:47,598 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:31:47,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:31:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:47,618 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:31:47,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-05-30 16:31:47,620 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:31:47,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 16:31:47,621 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@14e13fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:31:47,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:31:47,621 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:31:47,631 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 31 states. [2024-05-30 16:31:47,632 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:31:47,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 16:31:47,633 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 16:31:47,633 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-05-30 16:31:47,633 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:31:47,633 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:31:47,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:31:47 BasicIcfg [2024-05-30 16:31:47,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:31:47,637 INFO L158 Benchmark]: Toolchain (without parser) took 152987.01ms. Allocated memory was 163.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 100.5MB in the beginning and 580.4MB in the end (delta: -479.9MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-05-30 16:31:47,637 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:31:47,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.94ms. Allocated memory is still 163.6MB. Free memory was 100.2MB in the beginning and 137.8MB in the end (delta: -37.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-05-30 16:31:47,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.57ms. Allocated memory is still 163.6MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:31:47,637 INFO L158 Benchmark]: Boogie Preprocessor took 16.27ms. Allocated memory is still 163.6MB. Free memory was 135.8MB in the beginning and 134.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 16:31:47,637 INFO L158 Benchmark]: RCFGBuilder took 339.24ms. Allocated memory is still 163.6MB. Free memory was 134.4MB in the beginning and 119.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-30 16:31:47,638 INFO L158 Benchmark]: TraceAbstraction took 152415.46ms. Allocated memory was 163.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 118.7MB in the beginning and 580.4MB in the end (delta: -461.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-05-30 16:31:47,638 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.94ms. Allocated memory is still 163.6MB. Free memory was 100.2MB in the beginning and 137.8MB in the end (delta: -37.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.57ms. Allocated memory is still 163.6MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.27ms. Allocated memory is still 163.6MB. Free memory was 135.8MB in the beginning and 134.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 339.24ms. Allocated memory is still 163.6MB. Free memory was 134.4MB in the beginning and 119.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 152415.46ms. Allocated memory was 163.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 118.7MB in the beginning and 580.4MB in the end (delta: -461.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 34067, independent: 31378, independent conditional: 31378, independent unconditional: 0, dependent: 2689, dependent conditional: 2689, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31544, independent: 31378, independent conditional: 31378, independent unconditional: 0, dependent: 166, dependent conditional: 166, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31544, independent: 31378, independent conditional: 31378, independent unconditional: 0, dependent: 166, dependent conditional: 166, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33745, independent: 31378, independent conditional: 0, independent unconditional: 31378, dependent: 2367, dependent conditional: 2201, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33745, independent: 31378, independent conditional: 0, independent unconditional: 31378, dependent: 2367, dependent conditional: 0, dependent unconditional: 2367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33745, independent: 31378, independent conditional: 0, independent unconditional: 31378, dependent: 2367, dependent conditional: 0, dependent unconditional: 2367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31544, independent: 31378, independent conditional: 0, independent unconditional: 31378, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31544, independent: 31378, independent conditional: 0, independent unconditional: 31378, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 166, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 166, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 33745, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2201, dependent conditional: 0, dependent unconditional: 2201, unknown: 31544, unknown conditional: 0, unknown unconditional: 31544] , Statistics on independence cache: Total cache size (in pairs): 31544, Positive cache size: 31378, Positive conditional cache size: 0, Positive unconditional cache size: 31378, Negative cache size: 166, Negative conditional cache size: 0, Negative unconditional cache size: 166, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2201, Maximal queried relation: 14, Independence queries for same thread: 2523 - StatisticsResult: Reduction benchmarks 29.7ms Time before loop, 118.9ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 128, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 12.9ms Time before loop, 36.9ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 136, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 180.8ms Time before loop, 52.4ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 114, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 296.7ms Time before loop, 93.6ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 131, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 608.3ms Time before loop, 62.2ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 2, Reduction States: 136, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1269.6ms Time before loop, 714.8ms Time in loop, 2.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 193, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1238.5ms Time before loop, 2554.4ms Time in loop, 3.8s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 18, Reduction States: 548, Duplicate States: 37, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 1395.5ms Time before loop, 811.0ms Time in loop, 2.2s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 19, Reduction States: 578, Duplicate States: 45, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 1697.2ms Time before loop, 1127.6ms Time in loop, 2.8s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 20, Reduction States: 594, Duplicate States: 38, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 1507.4ms Time before loop, 1549.2ms Time in loop, 3.1s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 20, Reduction States: 631, Duplicate States: 36, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 2187.5ms Time before loop, 2058.2ms Time in loop, 4.2s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 20, Reduction States: 654, Duplicate States: 32, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 2741.5ms Time before loop, 5121.3ms Time in loop, 7.9s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 30, Reduction States: 1037, Duplicate States: 42, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 2156.7ms Time before loop, 2307.7ms Time in loop, 4.5s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 38, Reduction States: 1311, Duplicate States: 48, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 3111.7ms Time before loop, 2141.2ms Time in loop, 5.3s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 38, Reduction States: 1335, Duplicate States: 48, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 3757.9ms Time before loop, 79002.0ms Time in loop, 82.8s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 176, Reduction States: 15515, Duplicate States: 387, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 109, Transitions: 118, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 109, Transitions: 120, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 84, Transitions: 89, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 95, Transitions: 101, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 89, Transitions: 92, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 131, Transitions: 138, Traversal time: 2.0s - StatisticsResult: Visitor Statistics States: 469, Transitions: 538, Traversal time: 3.8s - StatisticsResult: Visitor Statistics States: 487, Transitions: 558, Traversal time: 2.2s - StatisticsResult: Visitor Statistics States: 490, Transitions: 559, Traversal time: 2.8s - StatisticsResult: Visitor Statistics States: 508, Transitions: 577, Traversal time: 3.1s - StatisticsResult: Visitor Statistics States: 520, Transitions: 589, Traversal time: 4.2s - StatisticsResult: Visitor Statistics States: 919, Transitions: 1111, Traversal time: 7.9s - StatisticsResult: Visitor Statistics States: 1186, Transitions: 1446, Traversal time: 4.5s - StatisticsResult: Visitor Statistics States: 1201, Transitions: 1464, Traversal time: 5.3s - StatisticsResult: Visitor Statistics States: 15347, Transitions: 19381, Traversal time: 82.8s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 61, RedundantProofs: 2, ProvenStates: 2751, Times there's more than one choice: 2666, Avg number of choices: 12.599054889131224 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 74, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 55, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 55, unknown conditional: 0, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 19 - StatisticsResult: Reduction benchmarks 1.8ms Time before loop, 20.9ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 91, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 92, Transitions: 104, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 10.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 31, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 32, Transitions: 32, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 106 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 152.2s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 120.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2766, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 2974 NumberOfCodeBlocks, 2968 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 4360 ConstructedInterpolants, 0 QuantifiedInterpolants, 26281 SizeOfPredicates, 374 NumberOfNonLiveVariables, 2792 ConjunctsInSsa, 963 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 4253/10548 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 106 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 106 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-30 16:31:47,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Forceful destruction successful, exit code 0 [2024-05-30 16:31:47,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Forceful destruction successful, exit code 0 [2024-05-30 16:31:48,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 16:31:48,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...