/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-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:54:45,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:54:46,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:54:46,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:54:46,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:54:46,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:54:46,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:54:46,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:54:46,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:54:46,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:54:46,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:54:46,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:54:46,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:54:46,044 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:54:46,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:54:46,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:54:46,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:54:46,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:54:46,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:54:46,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:54:46,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:54:46,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:54:46,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:54:46,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:54:46,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:54:46,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:54:46,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:54:46,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:54:46,046 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:54:46,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:54:46,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:54:46,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:54:46,048 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:54:46,049 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:54:46,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:54:46,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:54:46,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:54:46,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:54:46,270 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:54:46,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2024-05-30 16:54:47,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:54:47,500 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:54:47,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2024-05-30 16:54:47,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fcbc15b13/f3ee31ac63ad48848cca0f63b19cabdc/FLAG101db869b [2024-05-30 16:54:47,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fcbc15b13/f3ee31ac63ad48848cca0f63b19cabdc [2024-05-30 16:54:47,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:54:47,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:54:47,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:54:47,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:54:47,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:54:47,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa4c69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47, skipping insertion in model container [2024-05-30 16:54:47,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,547 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:54:47,671 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-send-receive.wvr.c[3107,3120] [2024-05-30 16:54:47,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:54:47,685 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:54:47,701 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-send-receive.wvr.c[3107,3120] [2024-05-30 16:54:47,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:54:47,715 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:54:47,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47 WrapperNode [2024-05-30 16:54:47,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:54:47,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:54:47,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:54:47,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:54:47,722 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:54:47" (1/1) ... [2024-05-30 16:54:47,729 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:54:47" (1/1) ... [2024-05-30 16:54:47,746 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2024-05-30 16:54:47,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:54:47,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:54:47,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:54:47,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:54:47,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:54:47,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:54:47,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:54:47,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:54:47,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (1/1) ... [2024-05-30 16:54:47,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:54:47,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:54:47,806 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:54:47,812 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:54:47,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:54:47,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:54:47,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:54:47,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:54:47,867 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:54:47,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:54:47,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:54:47,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:54:47,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 16:54:47,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 16:54:47,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:54:47,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:54:47,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:54:47,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 16:54:47,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:54:47,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:54:47,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:54:47,872 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:54:47,972 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:54:47,974 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:54:48,200 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:54:48,284 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:54:48,284 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 16:54:48,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:54:48 BoogieIcfgContainer [2024-05-30 16:54:48,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:54:48,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:54:48,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:54:48,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:54:48,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:54:47" (1/3) ... [2024-05-30 16:54:48,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc53353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:54:48, skipping insertion in model container [2024-05-30 16:54:48,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:54:47" (2/3) ... [2024-05-30 16:54:48,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc53353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:54:48, skipping insertion in model container [2024-05-30 16:54:48,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:54:48" (3/3) ... [2024-05-30 16:54:48,293 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2024-05-30 16:54:48,300 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:54:48,308 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:54:48,308 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:54:48,308 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:54:48,362 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-30 16:54:48,408 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:54:48,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:54:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:54:48,417 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:54:48,418 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:54:48,450 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:54:48,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:54:48,462 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;@776f46a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:54:48,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:54:48,468 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:48,724 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:48,724 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:54:48,724 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:54:48,858 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 299 states. [2024-05-30 16:54:48,858 INFO L212 cStratifiedReduction]: Copied states 1 times. [2024-05-30 16:54:48,866 INFO L78 Accepts]: Start accepts. Automaton has currently 367 states, but on-demand construction may add more states Word has length 112 [2024-05-30 16:54:48,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:48,869 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:48,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1591875662, now seen corresponding path program 1 times [2024-05-30 16:54:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:48,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959615316] [2024-05-30 16:54:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:54:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959615316] [2024-05-30 16:54:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959615316] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:54:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:54:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:54:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261350130] [2024-05-30 16:54:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:54:49,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:54:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:54:49,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:54:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:49,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:49,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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:54:49,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:49,174 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:49,337 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:49,337 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:54:49,337 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:54:49,435 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 312 states. [2024-05-30 16:54:49,435 INFO L212 cStratifiedReduction]: Copied states 1 times. [2024-05-30 16:54:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:49,435 INFO L78 Accepts]: Start accepts. Automaton has currently 392 states, but on-demand construction may add more states Word has length 109 [2024-05-30 16:54:49,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:49,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:54:49,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:49,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1689391724, now seen corresponding path program 1 times [2024-05-30 16:54:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65552251] [2024-05-30 16:54:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:54:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:49,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65552251] [2024-05-30 16:54:49,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65552251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:54:49,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:54:49,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:54:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923516154] [2024-05-30 16:54:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:54:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:54:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:54:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:54:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:49,804 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:49,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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:54:49,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:49,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:49,805 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:50,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:50,029 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:54:50,029 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:54:50,105 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 320 states. [2024-05-30 16:54:50,106 INFO L212 cStratifiedReduction]: Copied states 1 times. [2024-05-30 16:54:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:50,107 INFO L78 Accepts]: Start accepts. Automaton has currently 400 states, but on-demand construction may add more states Word has length 117 [2024-05-30 16:54:50,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:50,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:54:50,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:50,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1038102344, now seen corresponding path program 1 times [2024-05-30 16:54:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:50,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996665640] [2024-05-30 16:54:50,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:54:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996665640] [2024-05-30 16:54:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996665640] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:54:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126074831] [2024-05-30 16:54:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:54:50,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:54:50,274 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:54:50,300 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:54:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:50,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 16:54:50,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:54:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:54:50,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:54:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:54:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126074831] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:54:50,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:54:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2024-05-30 16:54:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564839008] [2024-05-30 16:54:50,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:54:50,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 16:54:50,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 16:54:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-30 16:54:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:50,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:50,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 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:54:50,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:50,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:50,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:50,594 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:50,732 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:50,733 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:54:50,733 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:54:50,817 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:50,817 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,818 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,909 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:50,909 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,909 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,926 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:50,927 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,927 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,946 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:50,946 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,946 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:54:50,984 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 533 states. [2024-05-30 16:54:50,984 INFO L212 cStratifiedReduction]: Copied states 90 times. [2024-05-30 16:54:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:54:50,985 INFO L78 Accepts]: Start accepts. Automaton has currently 725 states, but on-demand construction may add more states Word has length 134 [2024-05-30 16:54:50,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:50,994 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:54:51,194 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:54:51,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:51,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:51,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1173238272, now seen corresponding path program 2 times [2024-05-30 16:54:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:51,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465312978] [2024-05-30 16:54:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:54:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465312978] [2024-05-30 16:54:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465312978] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:54:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386699888] [2024-05-30 16:54:51,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:54:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:54:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:54:51,425 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:54:51,449 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:54:51,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:54:51,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:54:51,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 16:54:51,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:54:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-30 16:54:51,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 16:54:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386699888] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:54:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 16:54:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-05-30 16:54:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295546315] [2024-05-30 16:54:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:54:51,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-30 16:54:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-30 16:54:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-30 16:54:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:51,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:51,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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:54:51,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:51,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:51,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:54:51,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:51,642 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:51,855 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:51,855 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:51,855 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:51,916 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:51,917 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:51,917 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:52,114 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:52,114 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:52,114 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:52,182 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:52,182 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:52,182 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:52,184 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:52,184 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:52,184 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:52,195 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 727 states. [2024-05-30 16:54:52,195 INFO L212 cStratifiedReduction]: Copied states 53 times. [2024-05-30 16:54:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:52,196 INFO L78 Accepts]: Start accepts. Automaton has currently 1199 states, but on-demand construction may add more states Word has length 167 [2024-05-30 16:54:52,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:52,205 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:54:52,402 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:54:52,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:52,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash -17420618, now seen corresponding path program 3 times [2024-05-30 16:54:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:52,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993478476] [2024-05-30 16:54:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 22 proven. 64 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-05-30 16:54:52,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:52,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993478476] [2024-05-30 16:54:52,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993478476] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:54:52,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392573884] [2024-05-30 16:54:52,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:54:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:54:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:54:52,613 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:54:52,616 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:54:52,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 16:54:52,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:54:52,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 16:54:52,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:54:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-05-30 16:54:52,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:54:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-05-30 16:54:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392573884] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 16:54:52,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-30 16:54:52,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 5] total 13 [2024-05-30 16:54:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834120756] [2024-05-30 16:54:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:54:52,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 16:54:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 16:54:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-05-30 16:54:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:52,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:52,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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:54:52,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:52,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:52,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:52,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:52,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:52,819 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:53,084 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,085 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:53,085 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,134 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,134 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,134 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,138 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,138 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:53,138 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,225 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,225 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,225 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,227 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,227 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,227 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,439 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,439 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,440 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,491 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,492 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,492 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,493 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,493 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,494 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,505 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,506 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,506 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,509 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,509 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,509 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,525 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,525 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,525 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,526 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,526 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,526 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,541 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,541 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,541 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,542 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,542 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,542 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,562 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,563 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,563 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,563 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,564 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,564 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,578 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,579 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,580 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,581 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,581 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,581 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,600 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,602 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,602 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,603 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,603 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,603 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,630 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,630 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,630 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,631 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,631 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,631 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,647 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,648 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,648 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,648 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,649 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,649 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,649 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,649 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,650 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,687 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,687 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,687 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,712 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,712 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,713 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,728 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,728 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,728 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,742 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,742 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,742 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,758 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,758 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,758 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,774 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,775 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,775 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,789 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,789 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,789 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,813 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,813 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,813 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,851 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,851 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,851 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,977 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:53,977 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,977 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:53,988 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1648 states. [2024-05-30 16:54:53,989 INFO L212 cStratifiedReduction]: Copied states 345 times. [2024-05-30 16:54:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:53,989 INFO L78 Accepts]: Start accepts. Automaton has currently 1851 states, but on-demand construction may add more states Word has length 153 [2024-05-30 16:54:53,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:53,995 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:54:54,198 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:54:54,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:54,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1576003239, now seen corresponding path program 4 times [2024-05-30 16:54:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:54,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228295239] [2024-05-30 16:54:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-30 16:54:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:54,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228295239] [2024-05-30 16:54:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228295239] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:54:54,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794133527] [2024-05-30 16:54:54,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:54:54,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:54:54,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:54:54,394 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:54:54,398 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:54:54,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:54:54,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:54:54,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-30 16:54:54,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:54:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-30 16:54:54,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:54:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-30 16:54:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794133527] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:54:54,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:54:54,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-05-30 16:54:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289485732] [2024-05-30 16:54:54,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:54:54,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 16:54:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:54,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 16:54:54,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-05-30 16:54:54,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:54,815 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:54,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.0) internal successors, (209), 19 states have internal predecessors, (209), 0 states have call successors, (0), 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:54:54,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:54,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:54,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:54,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:54,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:54,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:54,816 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:55,159 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,159 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:55,159 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,188 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,188 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,188 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,191 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,191 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:55,191 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,258 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,259 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,259 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,260 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,261 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,261 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,468 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,468 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,468 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,521 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,521 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,521 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,523 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,523 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,524 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,533 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,533 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,533 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,534 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,535 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,535 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,552 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,552 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,552 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,553 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,553 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,553 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,568 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,569 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,569 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,570 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,570 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,570 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,588 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,589 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,590 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,590 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,590 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,604 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,604 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,604 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,605 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,605 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,605 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,626 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,626 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,626 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,627 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,627 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,627 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,653 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,653 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,653 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,655 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,655 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,655 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,670 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,670 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,671 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,671 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,671 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,671 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,672 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,672 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,672 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,717 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,717 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,717 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,743 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,743 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,743 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,761 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,761 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,761 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,776 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,776 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,776 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,795 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,795 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,795 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,810 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,810 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,810 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,823 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,823 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,823 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,845 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,845 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,845 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,875 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,946 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:55,946 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,946 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:55,960 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1657 states. [2024-05-30 16:54:55,961 INFO L212 cStratifiedReduction]: Copied states 345 times. [2024-05-30 16:54:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:54:55,961 INFO L78 Accepts]: Start accepts. Automaton has currently 1860 states, but on-demand construction may add more states Word has length 161 [2024-05-30 16:54:55,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:55,968 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:54:56,167 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:54:56,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:56,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1705729077, now seen corresponding path program 5 times [2024-05-30 16:54:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:56,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264374524] [2024-05-30 16:54:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-30 16:54:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:56,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264374524] [2024-05-30 16:54:56,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264374524] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:54:56,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:54:56,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-30 16:54:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381679631] [2024-05-30 16:54:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:54:56,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-30 16:54:56,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:56,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-30 16:54:56,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-30 16:54:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:56,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:56,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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:54:56,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:56,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:56,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:56,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:56,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:56,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:54:56,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:56,417 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:56,601 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:56,601 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:56,601 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,638 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:56,639 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,639 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,668 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:56,668 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:56,668 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,732 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:56,732 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,732 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,969 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:56,970 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,970 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,983 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:56,983 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:56,983 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,043 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,044 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,044 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,057 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,057 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,057 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,079 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,079 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,079 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,097 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,098 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,098 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,120 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,121 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,121 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,138 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,139 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,139 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,165 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,165 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,165 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,197 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,198 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,198 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,217 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,218 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,218 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,218 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,219 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,219 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,238 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,238 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,238 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,260 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,260 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,260 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,272 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,272 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,272 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,287 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,287 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,287 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,301 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,302 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,302 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,314 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,314 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,314 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,336 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,337 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,337 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,363 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,364 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,364 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,499 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:57,499 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,499 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:57,512 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2087 states. [2024-05-30 16:54:57,512 INFO L212 cStratifiedReduction]: Copied states 357 times. [2024-05-30 16:54:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:54:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:57,513 INFO L78 Accepts]: Start accepts. Automaton has currently 2459 states, but on-demand construction may add more states Word has length 197 [2024-05-30 16:54:57,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:57,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 16:54:57,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:54:57,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:54:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1519778198, now seen corresponding path program 1 times [2024-05-30 16:54:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:54:57,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430317872] [2024-05-30 16:54:57,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:54:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 143 proven. 31 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-05-30 16:54:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:54:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430317872] [2024-05-30 16:54:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430317872] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:54:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145397082] [2024-05-30 16:54:57,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:54:57,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:54:57,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:54:57,806 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:54:57,809 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:54:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:54:57,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-30 16:54:57,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:54:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 164 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-05-30 16:54:58,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:54:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 130 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-05-30 16:54:58,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145397082] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:54:58,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:54:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2024-05-30 16:54:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143663089] [2024-05-30 16:54:58,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:54:58,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-30 16:54:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:54:58,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-30 16:54:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-05-30 16:54:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:58,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:54:58,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 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:54:58,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:58,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:58,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:58,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:58,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:58,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:54:58,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:58,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:58,340 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:54:58,795 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:58,795 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:58,795 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:58,848 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:58,848 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:58,848 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:58,889 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:58,890 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:54:58,890 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:58,980 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:58,980 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:58,980 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,162 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,180 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,180 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,263 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,264 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,264 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,295 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,295 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,295 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,325 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,325 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,325 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,352 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,383 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,383 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,383 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,408 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,408 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,408 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,444 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,444 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,445 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,492 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,493 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,493 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,521 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,521 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,522 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,522 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,522 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,549 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,549 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,549 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,568 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,568 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,568 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,583 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,583 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,583 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,603 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,603 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,603 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,622 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,623 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,623 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,657 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,688 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,689 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,689 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,727 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,727 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,727 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,906 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:54:59,907 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,907 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:54:59,926 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2096 states. [2024-05-30 16:54:59,926 INFO L212 cStratifiedReduction]: Copied states 357 times. [2024-05-30 16:54:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:54:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:54:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:54:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:54:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:54:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:54:59,927 INFO L78 Accepts]: Start accepts. Automaton has currently 2468 states, but on-demand construction may add more states Word has length 205 [2024-05-30 16:54:59,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:54:59,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-30 16:55:00,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:00,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:00,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash -13725510, now seen corresponding path program 2 times [2024-05-30 16:55:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745129707] [2024-05-30 16:55:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-05-30 16:55:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745129707] [2024-05-30 16:55:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745129707] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:55:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:55:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:55:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490017235] [2024-05-30 16:55:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:55:00,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:55:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:00,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:55:00,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:55:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:00,536 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:00,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 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:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:00,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:00,537 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:00,749 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:00,749 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:55:00,749 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:00,786 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:00,787 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:00,787 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:00,818 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:00,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:55:00,818 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:00,884 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:00,884 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:00,884 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,017 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,018 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,018 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,032 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,033 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,033 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,114 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,114 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,114 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,185 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,186 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,186 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,206 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,206 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,206 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,207 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,207 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,207 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,229 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,229 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,229 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,244 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,244 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,244 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,256 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,257 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,257 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,275 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,276 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,276 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,291 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,291 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,291 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,305 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,305 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,305 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,436 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,452 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,452 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,482 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,482 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,482 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,525 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:01,526 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,526 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:01,531 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1792 states. [2024-05-30 16:55:01,532 INFO L212 cStratifiedReduction]: Copied states 237 times. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:01,532 INFO L78 Accepts]: Start accepts. Automaton has currently 2355 states, but on-demand construction may add more states Word has length 194 [2024-05-30 16:55:01,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:01,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-30 16:55:01,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:01,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1211017298, now seen corresponding path program 3 times [2024-05-30 16:55:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568005579] [2024-05-30 16:55:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 111 proven. 67 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-05-30 16:55:01,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:01,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568005579] [2024-05-30 16:55:01,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568005579] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:01,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738825025] [2024-05-30 16:55:01,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:55:01,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:01,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:01,915 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:55:01,936 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:55:02,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-30 16:55:02,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:02,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-30 16:55:02,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 125 proven. 42 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-30 16:55:02,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 48 proven. 119 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-30 16:55:02,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738825025] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:02,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:02,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 41 [2024-05-30 16:55:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767551258] [2024-05-30 16:55:02,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:02,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-30 16:55:02,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:02,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-30 16:55:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2024-05-30 16:55:02,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:02,942 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:02,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.634146341463414) internal successors, (313), 41 states have internal predecessors, (313), 0 states have call successors, (0), 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:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:02,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:02,943 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:03,493 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,493 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:55:03,494 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,532 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,532 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,532 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,561 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,561 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:55:03,561 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,625 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,625 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,625 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,862 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,862 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,862 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,875 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,933 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,933 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,933 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,982 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:03,982 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:03,982 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,000 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,000 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,000 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,001 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,001 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,001 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,019 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,020 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,020 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,033 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,033 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,033 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,045 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,046 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,046 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,065 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,065 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,065 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,083 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,083 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,083 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,097 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,097 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,097 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,122 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,122 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,122 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,149 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,149 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,149 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,195 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:04,195 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,196 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:04,211 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1801 states. [2024-05-30 16:55:04,211 INFO L212 cStratifiedReduction]: Copied states 237 times. [2024-05-30 16:55:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:04,212 INFO L78 Accepts]: Start accepts. Automaton has currently 2364 states, but on-demand construction may add more states Word has length 202 [2024-05-30 16:55:04,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:04,221 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:55:04,418 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,SelfDestructingSolverStorable9 [2024-05-30 16:55:04,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:04,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2120266506, now seen corresponding path program 4 times [2024-05-30 16:55:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57890314] [2024-05-30 16:55:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 56 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:55:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57890314] [2024-05-30 16:55:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57890314] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74207373] [2024-05-30 16:55:04,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:55:04,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:04,882 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:55:04,908 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:55:04,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:55:04,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:04,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-30 16:55:04,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 119 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:05,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 141 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74207373] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:06,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:06,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 22] total 57 [2024-05-30 16:55:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098562291] [2024-05-30 16:55:06,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:06,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-05-30 16:55:06,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:06,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-05-30 16:55:06,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2609, Unknown=0, NotChecked=0, Total=3192 [2024-05-30 16:55:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:06,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:06,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 8.596491228070175) internal successors, (490), 57 states have internal predecessors, (490), 0 states have call successors, (0), 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:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:06,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:06,802 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:07,924 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:07,924 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:55:07,924 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:07,971 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:07,971 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:07,971 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,010 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,010 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, ~back~0] [2024-05-30 16:55:08,010 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,097 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,097 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,097 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,290 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,291 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,291 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,309 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,309 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,309 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,389 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,389 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,390 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,461 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,461 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,462 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,487 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,487 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,487 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,488 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,488 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,488 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,514 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,514 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,515 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,537 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,537 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,537 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,554 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,554 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,554 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,576 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,576 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,598 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,598 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,598 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,621 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,622 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,622 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,655 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,655 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,655 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,692 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,692 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,693 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,754 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:08,754 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,754 INFO L395 cStratifiedReduction]: Actual level: [~front~0, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~back~0, ~v_assert~0] [2024-05-30 16:55:08,765 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1825 states. [2024-05-30 16:55:08,766 INFO L212 cStratifiedReduction]: Copied states 237 times. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:55:08,766 INFO L78 Accepts]: Start accepts. Automaton has currently 2391 states, but on-demand construction may add more states Word has length 218 [2024-05-30 16:55:08,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:08,775 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:55:08,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:08,975 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:08,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 159520194, now seen corresponding path program 5 times [2024-05-30 16:55:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:08,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715090357] [2024-05-30 16:55:08,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 36 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715090357] [2024-05-30 16:55:11,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715090357] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433669331] [2024-05-30 16:55:11,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:55:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:11,926 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:55:11,929 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:55:12,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-05-30 16:55:12,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:12,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 76 conjunts are in the unsatisfiable core [2024-05-30 16:55:12,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:13,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 16:55:13,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 16:55:13,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 16:55:13,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:55:13,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 78 [2024-05-30 16:55:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:14,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:15,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:55:15,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 123 treesize of output 297 [2024-05-30 16:55:18,973 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:18,982 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,503 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,511 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,529 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,554 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,564 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,577 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,596 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,619 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,631 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,643 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,656 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,693 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,705 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,725 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:19,741 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:19,763 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,779 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,801 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,808 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,833 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:19,851 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:19,866 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:19,888 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,903 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:19,918 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:19,943 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:19,953 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,970 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:19,993 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,009 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,022 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,042 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,052 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,097 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,104 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,147 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,158 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,168 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,181 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,213 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,228 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,245 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,260 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,269 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,298 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,311 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,324 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,336 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,355 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,365 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,381 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,399 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,412 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,439 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,449 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,564 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,571 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,584 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,595 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,635 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,650 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,680 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,697 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,704 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,722 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,739 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,752 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,769 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,780 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,802 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,817 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,828 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,840 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,869 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,882 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,897 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,917 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,927 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,942 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,962 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:20,972 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:20,988 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:20,997 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,005 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,147 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,180 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,219 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,310 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,317 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,338 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,348 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:21,378 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,403 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,418 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,428 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:21,445 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,453 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,472 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,483 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,532 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,539 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,602 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,625 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,632 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,652 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,663 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,678 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,688 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:21,704 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,712 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,730 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,749 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,756 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,776 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,805 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,818 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:21,833 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:21,855 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,868 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:21,893 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:21,906 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:21,921 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:21,939 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,096 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,114 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,124 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,142 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,157 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,174 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,198 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,205 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,227 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,236 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,255 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,262 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,295 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,313 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,328 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,345 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,387 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,410 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,422 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,438 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,447 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,462 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,597 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,605 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,622 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,634 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,646 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,658 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,740 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,747 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,762 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,772 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,785 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,802 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,817 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,834 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,851 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,859 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,869 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,886 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,896 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,906 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,916 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:22,932 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,938 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,960 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:22,973 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:22,998 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,015 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,030 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,049 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,061 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,071 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,088 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,095 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,116 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,125 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,155 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,162 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,172 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,234 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,241 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,250 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,281 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,298 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,313 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,332 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,341 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,354 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,373 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,387 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,399 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,411 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,433 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,451 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,461 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,478 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,507 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,519 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,537 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,570 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,580 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,599 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,609 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,779 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,797 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,807 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,823 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,841 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,856 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,878 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:23,886 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,912 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,930 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,945 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:23,963 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,980 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:23,989 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:24,009 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,016 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,035 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,062 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,072 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,096 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,109 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,125 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,144 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,157 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,271 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,278 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,288 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,332 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,351 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,364 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,376 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,422 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,445 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,486 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,494 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,539 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,552 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,672 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,756 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,777 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:24,794 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:24,809 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:24,827 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,842 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,852 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:24,879 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,892 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,903 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,913 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,925 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:24,982 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:24,993 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,000 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,018 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,046 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,061 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,075 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,088 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,103 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,114 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,138 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,145 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,182 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,247 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,255 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,279 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,287 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,301 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,329 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,340 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,352 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,361 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 16:55:25,378 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:25,385 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 16:55:25,403 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 16:55:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 10 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433669331] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:27,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 33] total 104 [2024-05-30 16:55:27,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787519838] [2024-05-30 16:55:27,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:27,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-05-30 16:55:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-05-30 16:55:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1188, Invalid=9524, Unknown=0, NotChecked=0, Total=10712 [2024-05-30 16:55:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:27,559 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:27,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.759615384615385) internal successors, (599), 104 states have internal predecessors, (599), 0 states have call successors, (0), 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:55:27,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:27,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:27,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:27,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:55:27,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:27,560 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:29,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 16:55:33,689 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:33,690 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:55:33,690 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:33,730 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:33,730 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:33,730 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:33,766 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:33,766 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:55:33,766 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,844 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:33,844 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,845 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:33,874 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,874 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,939 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:33,939 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,939 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,983 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:33,983 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,984 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:33,999 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,000 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,000 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,138 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,138 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,138 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,193 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,193 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,193 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,217 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,217 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,217 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,219 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,219 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,219 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,275 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,275 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,275 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,293 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,293 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,293 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,306 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,306 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,306 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,322 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,323 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,323 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,338 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,339 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,339 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,352 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,365 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,365 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,365 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,385 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,385 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,385 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,407 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:34,407 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,407 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:34,438 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1885 states. [2024-05-30 16:55:34,438 INFO L212 cStratifiedReduction]: Copied states 263 times. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:34,439 INFO L78 Accepts]: Start accepts. Automaton has currently 2367 states, but on-demand construction may add more states Word has length 229 [2024-05-30 16:55:34,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:34,446 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:55:34,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:34,644 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:34,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2004136663, now seen corresponding path program 6 times [2024-05-30 16:55:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252109171] [2024-05-30 16:55:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 21 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252109171] [2024-05-30 16:55:41,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252109171] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381005524] [2024-05-30 16:55:41,627 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:55:41,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:41,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:41,628 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:55:41,628 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:55:41,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-30 16:55:41,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:41,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 66 conjunts are in the unsatisfiable core [2024-05-30 16:55:41,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 27 proven. 319 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-30 16:55:43,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:44,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:55:44,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 143 treesize of output 190 [2024-05-30 16:55:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 21 proven. 162 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-05-30 16:55:44,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381005524] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:44,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:44,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 26, 14] total 74 [2024-05-30 16:55:44,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259922051] [2024-05-30 16:55:44,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:44,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-05-30 16:55:44,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:44,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-05-30 16:55:44,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=4954, Unknown=0, NotChecked=0, Total=5402 [2024-05-30 16:55:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:44,696 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:44,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 7.513513513513513) internal successors, (556), 74 states have internal predecessors, (556), 0 states have call successors, (0), 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:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:44,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:44,697 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:48,856 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:48,856 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:48,857 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:48,885 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:48,885 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:48,885 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,052 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:49,052 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,052 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,140 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:49,140 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,140 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,141 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:49,141 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,141 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:49,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:55:49,162 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,175 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:49,175 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,175 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,206 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1088 states. [2024-05-30 16:55:49,206 INFO L212 cStratifiedReduction]: Copied states 166 times. [2024-05-30 16:55:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:55:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:49,207 INFO L78 Accepts]: Start accepts. Automaton has currently 1258 states, but on-demand construction may add more states Word has length 257 [2024-05-30 16:55:49,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:49,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-05-30 16:55:49,412 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,SelfDestructingSolverStorable12 [2024-05-30 16:55:49,412 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:49,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash 633333076, now seen corresponding path program 7 times [2024-05-30 16:55:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091296365] [2024-05-30 16:55:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2024-05-30 16:55:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091296365] [2024-05-30 16:55:49,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091296365] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:55:49,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:55:49,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 16:55:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191894967] [2024-05-30 16:55:49,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:55:49,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 16:55:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 16:55:49,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-30 16:55:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:49,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:49,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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:55:49,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:49,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:49,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:49,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:49,700 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:49,956 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:49,956 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:55:49,956 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,987 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:49,988 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:49,988 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,006 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,006 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,006 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,118 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,118 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,118 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,119 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,119 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,119 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,146 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:55:50,146 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,183 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,183 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,183 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,187 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,187 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,187 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,255 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,255 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,255 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,287 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,288 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,288 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,356 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,356 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,356 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,420 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,420 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,420 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:55:50,533 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,533 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,533 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,562 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,562 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,562 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,592 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,592 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,592 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,631 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,631 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,631 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,658 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,658 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,743 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,743 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,743 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,814 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,814 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,815 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,833 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,833 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,833 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,835 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,835 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,857 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,857 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,857 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,874 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,874 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,889 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,889 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,889 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,906 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,906 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,906 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,923 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,923 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,923 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,938 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,938 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,938 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,954 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,954 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,954 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,975 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:50,975 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:50,975 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:51,001 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:51,001 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:51,001 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:51,068 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:55:51,068 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:51,068 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:55:51,076 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2711 states. [2024-05-30 16:55:51,076 INFO L212 cStratifiedReduction]: Copied states 343 times. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:55:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:55:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:55:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:55:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:55:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:55:51,077 INFO L78 Accepts]: Start accepts. Automaton has currently 3444 states, but on-demand construction may add more states Word has length 254 [2024-05-30 16:55:51,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:51,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-30 16:55:51,079 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:51,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1486176759, now seen corresponding path program 8 times [2024-05-30 16:55:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390487568] [2024-05-30 16:55:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 14 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:57,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390487568] [2024-05-30 16:55:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390487568] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771445415] [2024-05-30 16:55:57,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:55:57,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:57,963 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:55:57,964 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:55:58,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:55:58,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:58,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 99 conjunts are in the unsatisfiable core [2024-05-30 16:55:58,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:01,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:56:01,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 25 [2024-05-30 16:56:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 17 proven. 492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:01,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:03,532 INFO L349 Elim1Store]: treesize reduction 150, result has 57.0 percent of original size [2024-05-30 16:56:03,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 211 treesize of output 250 [2024-05-30 16:56:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 14 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:06,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771445415] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:06,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:06,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 41, 41] total 120 [2024-05-30 16:56:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983105096] [2024-05-30 16:56:06,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:06,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2024-05-30 16:56:06,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2024-05-30 16:56:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2317, Invalid=11963, Unknown=0, NotChecked=0, Total=14280 [2024-05-30 16:56:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:06,320 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:06,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 120 states have (on average 5.616666666666666) internal successors, (674), 120 states have internal predecessors, (674), 0 states have call successors, (0), 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:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:56:06,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:06,321 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:14,213 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,214 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:56:14,214 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,261 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,261 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,261 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,288 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,288 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,288 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,387 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,387 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,387 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,389 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,389 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,389 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,414 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,414 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:56:14,414 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,444 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,444 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,447 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,450 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,450 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,450 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,488 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,488 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,488 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,516 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,516 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,516 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,567 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,567 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,567 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,635 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,635 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,635 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 16:56:14,751 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,752 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,752 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,778 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,779 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,779 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,838 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,838 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,838 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,880 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,880 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,880 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,911 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,911 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,911 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,967 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:14,967 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:14,970 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,042 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,042 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,043 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,060 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,060 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,060 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,061 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,062 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,062 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,083 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,083 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,083 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,098 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,099 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,099 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,112 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,113 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,113 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,129 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,130 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,130 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,146 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,146 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,162 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,177 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,177 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,177 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,198 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,198 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,198 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,222 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,222 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,222 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,270 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:56:15,270 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,270 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:56:15,317 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2794 states. [2024-05-30 16:56:15,317 INFO L212 cStratifiedReduction]: Copied states 343 times. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:56:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 16:56:15,319 INFO L78 Accepts]: Start accepts. Automaton has currently 3527 states, but on-demand construction may add more states Word has length 290 [2024-05-30 16:56:15,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:15,326 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:56:15,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:15,521 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:15,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:15,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1805814045, now seen corresponding path program 9 times [2024-05-30 16:56:15,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:15,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120635823] [2024-05-30 16:56:15,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:15,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 108 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120635823] [2024-05-30 16:56:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120635823] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848795317] [2024-05-30 16:56:22,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:56:22,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:22,853 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:56:22,855 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:56:23,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-05-30 16:56:23,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:23,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 121 conjunts are in the unsatisfiable core [2024-05-30 16:56:23,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:28,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:56:28,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 33 [2024-05-30 16:56:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 17 proven. 757 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:29,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:38,279 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 666 DAG size of output: 638 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-05-30 16:56:38,280 INFO L349 Elim1Store]: treesize reduction 70, result has 96.1 percent of original size [2024-05-30 16:56:38,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 300 treesize of output 1801 [2024-05-30 17:04:36,602 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:36,734 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:36,780 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:36,881 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:37,159 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:37,726 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,004 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,014 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,064 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,067 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,335 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,462 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,474 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,537 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,550 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,564 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,600 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,614 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,619 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,766 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,780 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:38,785 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,872 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:38,897 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:38,984 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:39,000 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,068 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:39,083 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,096 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,126 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:39,148 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:39,165 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,187 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,207 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:39,469 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,555 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:39,561 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,644 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:39,796 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:39,805 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:40,098 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:40,138 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:40,171 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:40,448 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:40,578 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:40,983 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,108 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,114 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,162 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,312 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,321 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,399 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,405 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,437 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,637 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,647 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,702 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,722 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,818 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:41,844 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,858 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,898 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:41,916 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:41,932 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:41,958 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:42,017 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:42,038 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:42,054 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:42,097 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:42,106 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:42,143 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-05-30 17:04:42,159 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:42,406 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:42,451 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:42,482 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:42,931 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:42,967 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:43,002 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-05-30 17:04:43,225 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:43,251 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:43,729 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:43,791 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:04:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 18 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:04:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848795317] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:04:50,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:04:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 52, 47] total 152 [2024-05-30 17:04:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290349318] [2024-05-30 17:04:50,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:04:50,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2024-05-30 17:04:50,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:04:50,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2024-05-30 17:04:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3586, Invalid=19366, Unknown=0, NotChecked=0, Total=22952 [2024-05-30 17:04:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:50,978 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:04:50,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 5.342105263157895) internal successors, (812), 152 states have internal predecessors, (812), 0 states have call successors, (0), 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 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:04:50,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:04:50,979 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:04:53,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:05:05,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:05:13,685 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:13,685 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:05:13,685 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:13,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:13,714 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:13,714 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:13,829 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:13,829 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:13,829 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:13,909 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:13,910 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:13,910 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,019 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,020 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,020 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,042 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,042 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,042 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,081 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,081 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,081 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,103 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,104 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:05:14,104 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,106 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,106 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,106 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,147 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,147 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,195 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,196 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,196 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,258 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,258 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,258 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,351 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,352 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:14,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,543 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,574 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,575 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,575 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,690 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,690 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,691 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,749 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,750 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,750 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,939 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,939 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,939 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,981 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,981 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,981 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,996 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,996 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,996 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,998 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:14,998 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:14,998 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,017 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,017 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,017 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,030 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,030 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,030 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,042 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,042 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,042 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,057 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,057 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,057 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,070 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,071 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,071 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,083 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,083 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,083 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,096 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,096 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,096 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,114 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,115 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,115 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,184 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,184 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,184 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,229 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:15,229 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,229 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:15,297 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3591 states. [2024-05-30 17:05:15,298 INFO L212 cStratifiedReduction]: Copied states 357 times. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:05:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:05:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2024-05-30 17:05:15,299 INFO L78 Accepts]: Start accepts. Automaton has currently 4656 states, but on-demand construction may add more states Word has length 337 [2024-05-30 17:05:15,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:05:15,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-05-30 17:05:15,501 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,SelfDestructingSolverStorable15 [2024-05-30 17:05:15,502 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:05:15,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:05:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash -532260175, now seen corresponding path program 10 times [2024-05-30 17:05:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:05:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273363130] [2024-05-30 17:05:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:05:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:05:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:05:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 661 proven. 540 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-05-30 17:05:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:05:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273363130] [2024-05-30 17:05:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273363130] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:05:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812088009] [2024-05-30 17:05:16,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 17:05:16,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:05:16,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:05:16,547 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 17:05:16,547 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 17:05:16,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 17:05:16,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:05:16,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 42 conjunts are in the unsatisfiable core [2024-05-30 17:05:16,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:05:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 706 proven. 508 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-30 17:05:18,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:05:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 769 proven. 445 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-30 17:05:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812088009] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:05:21,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:05:21,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 41, 40] total 113 [2024-05-30 17:05:21,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770227799] [2024-05-30 17:05:21,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:05:21,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2024-05-30 17:05:21,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:05:21,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2024-05-30 17:05:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2108, Invalid=10548, Unknown=0, NotChecked=0, Total=12656 [2024-05-30 17:05:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:21,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:05:21,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 7.823008849557522) internal successors, (884), 113 states have internal predecessors, (884), 0 states have call successors, (0), 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 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:05:21,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:05:21,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:05:21,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2024-05-30 17:05:21,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:21,093 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:05:23,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:05:23,483 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,512 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,512 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,512 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,539 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,539 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,539 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,610 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,610 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,611 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,711 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,711 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,711 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,728 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,729 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,729 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,765 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,765 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,765 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,787 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,787 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:05:23,788 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,789 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,790 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,790 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,831 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,831 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,831 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,866 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,866 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,866 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,928 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,928 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:23,928 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:24,012 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,012 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:24,012 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:05:24,166 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,166 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,166 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,197 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,197 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,197 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,251 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,252 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,252 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,267 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,267 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,267 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,333 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,333 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,334 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,386 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,386 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,386 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,407 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,407 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,407 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,409 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,409 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,409 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,432 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,432 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,432 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,449 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,450 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,450 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,465 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,465 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,465 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,483 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,500 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,500 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,500 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,516 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,516 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,516 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,532 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,532 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,532 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,554 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,554 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,554 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,747 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,747 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,747 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,790 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:24,790 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,790 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:24,814 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3603 states. [2024-05-30 17:05:24,814 INFO L212 cStratifiedReduction]: Copied states 357 times. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:05:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:05:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:05:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2024-05-30 17:05:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 17:05:24,815 INFO L78 Accepts]: Start accepts. Automaton has currently 4668 states, but on-demand construction may add more states Word has length 353 [2024-05-30 17:05:24,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:05:24,825 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 17:05:25,017 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,SelfDestructingSolverStorable16 [2024-05-30 17:05:25,018 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:05:25,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:05:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1088321785, now seen corresponding path program 11 times [2024-05-30 17:05:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:05:25,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311056371] [2024-05-30 17:05:25,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:05:25,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:05:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:05:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 507 proven. 880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:05:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:05:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311056371] [2024-05-30 17:05:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311056371] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:05:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574107238] [2024-05-30 17:05:35,784 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 17:05:35,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:05:35,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:05:35,785 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:05:35,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-30 17:05:36,076 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-05-30 17:05:36,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:05:36,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 143 conjunts are in the unsatisfiable core [2024-05-30 17:05:36,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:05:44,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 17:05:44,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:05:44,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 54 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 130 treesize of output 54 [2024-05-30 17:05:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 64 proven. 1323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:05:44,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:05:53,690 INFO L349 Elim1Store]: treesize reduction 536, result has 49.9 percent of original size [2024-05-30 17:05:53,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 346 treesize of output 612 [2024-05-30 17:06:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 28 proven. 1359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:06:00,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574107238] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:06:00,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:06:00,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 63, 58] total 184 [2024-05-30 17:06:00,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35046220] [2024-05-30 17:06:00,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:06:00,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 184 states [2024-05-30 17:06:00,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:06:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2024-05-30 17:06:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4125, Invalid=29547, Unknown=0, NotChecked=0, Total=33672 [2024-05-30 17:06:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:00,479 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:06:00,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 184 states, 184 states have (on average 5.434782608695652) internal successors, (1000), 184 states have internal predecessors, (1000), 0 states have call successors, (0), 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 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 17:06:00,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:00,480 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:06:18,412 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,412 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:06:18,412 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,442 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,442 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,442 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,579 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,580 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,580 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,807 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,807 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,807 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,916 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,916 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,916 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,936 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,936 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,936 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,974 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,974 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,974 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,996 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,996 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:06:18,996 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,998 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:18,998 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:18,998 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,038 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,039 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,039 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,087 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,087 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,087 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,149 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,149 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,149 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,238 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,238 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,238 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, ~v_assert~0] [2024-05-30 17:06:19,479 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,479 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,479 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,509 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,509 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,509 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,567 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,567 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,567 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,594 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,594 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,594 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,732 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,732 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,733 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,813 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,813 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,813 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,917 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,918 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,918 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,967 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,967 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,967 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,986 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,986 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,986 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,988 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:19,988 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:19,988 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,010 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,010 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,010 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,027 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,028 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,028 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,043 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,043 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,043 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,061 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,061 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,061 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,079 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,079 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,079 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,095 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,096 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,096 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,112 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,113 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,113 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,135 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,135 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,135 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,201 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,202 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,202 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,254 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:20,255 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,255 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~b~0#1, ~sum~0, thread1Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n~0, #valid, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~v_assert~0, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:20,357 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3794 states. [2024-05-30 17:06:20,358 INFO L212 cStratifiedReduction]: Copied states 533 times. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2024-05-30 17:06:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 17:06:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-05-30 17:06:20,359 INFO L78 Accepts]: Start accepts. Automaton has currently 4683 states, but on-demand construction may add more states Word has length 361 [2024-05-30 17:06:20,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:06:20,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-05-30 17:06:20,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-30 17:06:20,562 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:06:20,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:06:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1254388253, now seen corresponding path program 12 times [2024-05-30 17:06:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:06:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388229354] [2024-05-30 17:06:20,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:06:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:06:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:06:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 86 proven. 1398 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:06:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:06:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388229354] [2024-05-30 17:06:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388229354] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:06:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735742979] [2024-05-30 17:06:38,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 17:06:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:06:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:06:38,654 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 17:06:38,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-30 17:06:39,636 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2024-05-30 17:06:39,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:06:39,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 155 conjunts are in the unsatisfiable core [2024-05-30 17:06:39,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:06:45,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:06:45,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 121 treesize of output 41 [2024-05-30 17:06:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 10 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:06:46,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:07:24,345 INFO L349 Elim1Store]: treesize reduction 450, result has 64.4 percent of original size [2024-05-30 17:07:24,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 368 treesize of output 915 [2024-05-30 17:07:24,677 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:07:24,769 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:07:25,218 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:07:25,321 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:07:25,458 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:07:25,572 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:07:25,681 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-30 17:07:26,139 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-05-30 17:07:26,171 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-05-30 17:07:26,229 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2024-05-30 17:07:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 5 proven. 1475 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:07:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735742979] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:07:44,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:07:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 60] total 158 [2024-05-30 17:07:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38310843] [2024-05-30 17:07:44,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:07:44,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 158 states [2024-05-30 17:07:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:07:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2024-05-30 17:07:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4736, Invalid=20058, Unknown=12, NotChecked=0, Total=24806 [2024-05-30 17:07:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:44,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:07:44,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 158 states, 158 states have (on average 5.841772151898734) internal successors, (923), 158 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 17:07:44,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-05-30 17:07:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:07:44,486 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:07:46,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:07:59,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:01,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:03,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:05,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:10,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:12,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:14,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:17,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:19,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 17:08:24,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-05-30 17:08:25,292 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 17:08:25,293 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 17:08:25,293 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 17:08:26,307 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 17:08:26,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-30 17:08:26,493 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-30 17:08:26,626 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 288 states. [2024-05-30 17:08:26,626 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:08:26,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-30 17:08:26,626 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-30 17:08:26,628 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 17:08:26,632 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 137 [2024-05-30 17:08:26,689 INFO L445 BasicCegarLoop]: Path program histogram: [12, 5, 1, 1] [2024-05-30 17:08:26,690 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-05-30 17:08:26,692 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 17:08:26,692 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 17:08:26,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 05:08:26 BasicIcfg [2024-05-30 17:08:26,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 17:08:26,694 INFO L158 Benchmark]: Toolchain (without parser) took 819172.71ms. Allocated memory was 281.0MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 207.8MB in the beginning and 1.1GB in the end (delta: -929.0MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2024-05-30 17:08:26,694 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 281.0MB. Free memory is still 247.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 17:08:26,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.79ms. Allocated memory is still 281.0MB. Free memory was 207.5MB in the beginning and 195.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 17:08:26,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 281.0MB. Free memory was 195.1MB in the beginning and 193.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:08:26,695 INFO L158 Benchmark]: Boogie Preprocessor took 21.70ms. Allocated memory is still 281.0MB. Free memory was 193.1MB in the beginning and 191.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:08:26,695 INFO L158 Benchmark]: RCFGBuilder took 514.90ms. Allocated memory is still 281.0MB. Free memory was 191.5MB in the beginning and 234.9MB in the end (delta: -43.4MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2024-05-30 17:08:26,695 INFO L158 Benchmark]: TraceAbstraction took 818407.66ms. Allocated memory was 281.0MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 233.8MB in the beginning and 1.1GB in the end (delta: -902.9MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2024-05-30 17:08:26,696 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.42ms. Allocated memory is still 281.0MB. Free memory is still 247.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.79ms. Allocated memory is still 281.0MB. Free memory was 207.5MB in the beginning and 195.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 281.0MB. Free memory was 195.1MB in the beginning and 193.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.70ms. Allocated memory is still 281.0MB. Free memory was 193.1MB in the beginning and 191.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 514.90ms. Allocated memory is still 281.0MB. Free memory was 191.5MB in the beginning and 234.9MB in the end (delta: -43.4MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * TraceAbstraction took 818407.66ms. Allocated memory was 281.0MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 233.8MB in the beginning and 1.1GB in the end (delta: -902.9MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 74688, independent: 72834, independent conditional: 72834, independent unconditional: 0, dependent: 1854, dependent conditional: 1854, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73242, independent: 72834, independent conditional: 72834, independent unconditional: 0, dependent: 408, dependent conditional: 408, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73242, independent: 72834, independent conditional: 72834, independent unconditional: 0, dependent: 408, dependent conditional: 408, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78098, independent: 72834, independent conditional: 0, independent unconditional: 72834, dependent: 5264, dependent conditional: 4856, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78098, independent: 72834, independent conditional: 0, independent unconditional: 72834, dependent: 5264, dependent conditional: 0, dependent unconditional: 5264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78098, independent: 72834, independent conditional: 0, independent unconditional: 72834, dependent: 5264, dependent conditional: 0, dependent unconditional: 5264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73242, independent: 72834, independent conditional: 0, independent unconditional: 72834, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73242, independent: 72777, independent conditional: 0, independent unconditional: 72777, dependent: 465, dependent conditional: 0, dependent unconditional: 465, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 465, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 465, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 465, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 545, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 473, dependent conditional: 0, dependent unconditional: 473, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 78098, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4856, dependent conditional: 0, dependent unconditional: 4856, unknown: 73242, unknown conditional: 0, unknown unconditional: 73242] , Statistics on independence cache: Total cache size (in pairs): 73242, Positive cache size: 72834, Positive conditional cache size: 0, Positive unconditional cache size: 72834, Negative cache size: 408, Negative conditional cache size: 0, Negative unconditional cache size: 408, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4856, Maximal queried relation: 19, Independence queries for same thread: 1446 - StatisticsResult: Reduction benchmarks 14.3ms Time before loop, 374.9ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 5, Reduction States: 299, Duplicate States: 1, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 11.6ms Time before loop, 249.4ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 5, Reduction States: 312, Duplicate States: 1, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 83.6ms Time before loop, 216.1ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 5, Reduction States: 320, Duplicate States: 1, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 9.2ms Time before loop, 380.5ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 13, Reduction States: 533, Duplicate States: 90, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 5.4ms Time before loop, 547.3ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 11, Reduction States: 727, Duplicate States: 53, Protected Variables: 5 - StatisticsResult: Reduction benchmarks 4.4ms Time before loop, 1165.3ms Time in loop, 1.2s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 39, Reduction States: 1648, Duplicate States: 345, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 137.3ms Time before loop, 1007.2ms Time in loop, 1.1s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 39, Reduction States: 1657, Duplicate States: 345, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 2.9ms Time before loop, 1091.9ms Time in loop, 1.1s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 29, Reduction States: 2087, Duplicate States: 357, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 182.5ms Time before loop, 1403.4ms Time in loop, 1.6s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 29, Reduction States: 2096, Duplicate States: 357, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 5.5ms Time before loop, 988.6ms Time in loop, 1.0s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 22, Reduction States: 1792, Duplicate States: 237, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 322.8ms Time before loop, 945.0ms Time in loop, 1.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 22, Reduction States: 1801, Duplicate States: 237, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 762.6ms Time before loop, 1200.1ms Time in loop, 2.0s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 22, Reduction States: 1825, Duplicate States: 237, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 4627.5ms Time before loop, 2250.7ms Time in loop, 6.9s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 25, Reduction States: 1885, Duplicate States: 263, Protected Variables: 21 - StatisticsResult: Reduction benchmarks 2170.3ms Time before loop, 2338.0ms Time in loop, 4.5s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 12, Reduction States: 1088, Duplicate States: 166, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 5.3ms Time before loop, 1370.3ms Time in loop, 1.4s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 37, Reduction States: 2711, Duplicate States: 343, Protected Variables: 21 - StatisticsResult: Reduction benchmarks 3478.9ms Time before loop, 5516.9ms Time in loop, 9.0s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 37, Reduction States: 2794, Duplicate States: 343, Protected Variables: 21 - StatisticsResult: Reduction benchmarks 11371.8ms Time before loop, 12946.1ms Time in loop, 24.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 37, Reduction States: 3591, Duplicate States: 357, Protected Variables: 21 - StatisticsResult: Reduction benchmarks 1932.9ms Time before loop, 1787.9ms Time in loop, 3.7s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 37, Reduction States: 3603, Duplicate States: 357, Protected Variables: 21 - StatisticsResult: Reduction benchmarks 13184.8ms Time before loop, 6691.9ms Time in loop, 19.9s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 39, Reduction States: 3794, Duplicate States: 533, Protected Variables: 30 - StatisticsResult: Reduction benchmarks 10057.8ms Time before loop, 32082.0ms Time in loop, 42.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 288, Duplicate States: 0, Protected Variables: 21 - StatisticsResult: Visitor Statistics States: 232, Transitions: 241, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 235, Transitions: 247, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 242, Transitions: 254, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 444, Transitions: 483, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 593, Transitions: 644, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 1492, Transitions: 1889, Traversal time: 1.2s - StatisticsResult: Visitor Statistics States: 1500, Transitions: 1897, Traversal time: 1.1s - StatisticsResult: Visitor Statistics States: 1853, Transitions: 2317, Traversal time: 1.1s - StatisticsResult: Visitor Statistics States: 1861, Transitions: 2325, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 1567, Transitions: 1872, Traversal time: 1.0s - StatisticsResult: Visitor Statistics States: 1575, Transitions: 1880, Traversal time: 1.3s - StatisticsResult: Visitor Statistics States: 1588, Transitions: 1892, Traversal time: 2.0s - StatisticsResult: Visitor Statistics States: 1642, Transitions: 1835, Traversal time: 6.9s - StatisticsResult: Visitor Statistics States: 832, Transitions: 990, Traversal time: 4.5s - StatisticsResult: Visitor Statistics States: 2411, Transitions: 2705, Traversal time: 1.4s - StatisticsResult: Visitor Statistics States: 2455, Transitions: 2754, Traversal time: 9.0s - StatisticsResult: Visitor Statistics States: 3167, Transitions: 3530, Traversal time: 24.3s - StatisticsResult: Visitor Statistics States: 3177, Transitions: 3540, Traversal time: 3.7s - StatisticsResult: Visitor Statistics States: 3367, Transitions: 3756, Traversal time: 19.9s - StatisticsResult: Visitor Statistics States: 214, Transitions: 219, Traversal time: 42.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 97, RedundantProofs: 17, ProvenStates: 2785, Times there's more than one choice: 1663, Avg number of choices: 7.379533213644525 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 165 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 818.3s, OverallIterations: 19, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 123.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: 734, 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.4s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 688.0s InterpolantComputationTime, 7256 NumberOfCodeBlocks, 7062 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 10282 ConstructedInterpolants, 225 QuantifiedInterpolants, 226775 SizeOfPredicates, 306 NumberOfNonLiveVariables, 6348 ConjunctsInSsa, 783 ConjunctsInUnsatCore, 46 InterpolantComputations, 7 PerfectInterpolantSequences, 6183/21670 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown