/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/unroll-cond-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 17:08:16,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 17:08:16,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 17:08:16,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 17:08:16,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 17:08:16,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 17:08:16,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 17:08:16,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 17:08:16,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 17:08:16,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 17:08:16,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 17:08:16,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 17:08:16,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 17:08:16,383 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 17:08:16,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 17:08:16,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 17:08:16,384 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 17:08:16,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 17:08:16,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 17:08:16,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 17:08:16,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 17:08:16,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 17:08:16,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 17:08:16,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 17:08:16,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 17:08:16,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 17:08:16,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 17:08:16,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 17:08:16,387 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 17:08:16,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 17:08:16,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 17:08:16,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 17:08:16,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 17:08:16,389 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 17:08:16,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 17:08:16,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 17:08:16,389 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 17:08:16,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 17:08:16,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 17:08:16,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 17:08:16,390 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 17:08:16,390 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 17:08:16,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 17:08:16,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 17:08:16,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 17:08:16,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 17:08:16,626 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 17:08:16,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-05-30 17:08:17,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 17:08:17,769 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 17:08:17,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-05-30 17:08:17,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0e39b04e4/7f17591f034248d9853abc9800e18d61/FLAGf96b56d53 [2024-05-30 17:08:17,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0e39b04e4/7f17591f034248d9853abc9800e18d61 [2024-05-30 17:08:17,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 17:08:17,787 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 17:08:17,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 17:08:17,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 17:08:17,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 17:08:17,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:17,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a5d8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17, skipping insertion in model container [2024-05-30 17:08:17,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:17,809 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 17:08:17,935 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/unroll-cond-2.wvr.c[2474,2487] [2024-05-30 17:08:17,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:08:17,948 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 17:08:17,964 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/unroll-cond-2.wvr.c[2474,2487] [2024-05-30 17:08:17,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 17:08:17,980 INFO L206 MainTranslator]: Completed translation [2024-05-30 17:08:17,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17 WrapperNode [2024-05-30 17:08:17,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 17:08:17,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 17:08:17,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 17:08:17,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 17:08:17,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:17,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,017 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 144 [2024-05-30 17:08:18,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 17:08:18,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 17:08:18,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 17:08:18,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 17:08:18,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 17:08:18,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 17:08:18,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 17:08:18,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 17:08:18,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (1/1) ... [2024-05-30 17:08:18,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 17:08:18,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:08:18,081 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 17:08:18,090 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 17:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 17:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 17:08:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 17:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 17:08:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 17:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 17:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 17:08:18,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 17:08:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 17:08:18,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 17:08:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 17:08:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 17:08:18,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 17:08:18,132 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 17:08:18,221 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 17:08:18,223 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 17:08:18,452 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 17:08:18,462 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 17:08:18,462 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 17:08:18,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:08:18 BoogieIcfgContainer [2024-05-30 17:08:18,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 17:08:18,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 17:08:18,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 17:08:18,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 17:08:18,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 05:08:17" (1/3) ... [2024-05-30 17:08:18,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401c0cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:08:18, skipping insertion in model container [2024-05-30 17:08:18,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 05:08:17" (2/3) ... [2024-05-30 17:08:18,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401c0cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 05:08:18, skipping insertion in model container [2024-05-30 17:08:18,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 05:08:18" (3/3) ... [2024-05-30 17:08:18,469 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2024-05-30 17:08:18,475 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 17:08:18,484 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 17:08:18,485 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 17:08:18,486 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 17:08:18,576 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 17:08:18,611 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:08:18,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 17:08:18,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:08:18,612 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 17:08:18,618 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 17:08:18,656 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 17:08:18,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 17:08:18,668 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;@511a6ce9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 17:08:18,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 17:08:18,675 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:18,803 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:18,803 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:18,803 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:18,867 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:18,867 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:18,867 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:18,924 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:18,924 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:18,925 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:18,956 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:18,956 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:18,956 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:18,993 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:18,993 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:18,993 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,039 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,039 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,039 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,071 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,071 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,071 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,111 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,112 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,112 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,132 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,132 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,132 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,178 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,178 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,178 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,215 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,216 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,216 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,245 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,245 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,245 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,345 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,346 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,347 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,350 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 744 states. [2024-05-30 17:08:19,350 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:08:19,353 INFO L78 Accepts]: Start accepts. Automaton has currently 788 states, but on-demand construction may add more states Word has length 107 [2024-05-30 17:08:19,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:19,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:19,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:19,375 INFO L85 PathProgramCache]: Analyzing trace with hash 198291129, now seen corresponding path program 1 times [2024-05-30 17:08:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480995312] [2024-05-30 17:08:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:08:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:19,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480995312] [2024-05-30 17:08:19,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480995312] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:08:19,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:08:19,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 17:08:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304121523] [2024-05-30 17:08:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:08:19,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 17:08:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:08:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 17:08:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 17:08:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:19,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:08:19,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 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:08:19,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:19,656 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:19,691 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,691 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,692 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,704 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,705 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,705 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,720 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,720 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,721 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,734 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,735 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,735 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,746 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,746 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,746 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,760 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,760 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,760 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,778 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,778 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,778 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,789 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,789 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,789 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,799 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,800 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,801 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,820 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,820 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,820 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,835 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,835 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,845 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,845 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,846 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,905 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:19,905 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:19,905 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:19,913 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 807 states. [2024-05-30 17:08:19,914 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:08:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:19,915 INFO L78 Accepts]: Start accepts. Automaton has currently 891 states, but on-demand construction may add more states Word has length 102 [2024-05-30 17:08:19,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:19,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 17:08:19,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:19,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 732039595, now seen corresponding path program 1 times [2024-05-30 17:08:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:19,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958587150] [2024-05-30 17:08:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:19,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:08:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958587150] [2024-05-30 17:08:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958587150] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:08:20,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:08:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 17:08:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543066181] [2024-05-30 17:08:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:08:20,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 17:08:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:08:20,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 17:08:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-30 17:08:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:20,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:08:20,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:08:20,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:20,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:20,278 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:20,319 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,319 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,319 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,340 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,340 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,341 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,357 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,357 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,357 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,371 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,371 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,372 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,382 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,385 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,385 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,405 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,405 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,405 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,427 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,427 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,427 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,440 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,440 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,441 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,452 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,452 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,453 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,477 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,477 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,477 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,497 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,498 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,498 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,512 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,512 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,513 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,598 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:20,599 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:20,599 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:20,611 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 830 states. [2024-05-30 17:08:20,611 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:08:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:20,612 INFO L78 Accepts]: Start accepts. Automaton has currently 914 states, but on-demand construction may add more states Word has length 115 [2024-05-30 17:08:20,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:20,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 17:08:20,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:20,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -660677086, now seen corresponding path program 1 times [2024-05-30 17:08:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18223123] [2024-05-30 17:08:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:08:20,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18223123] [2024-05-30 17:08:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18223123] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 17:08:20,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 17:08:20,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-30 17:08:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677152537] [2024-05-30 17:08:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 17:08:20,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 17:08:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:08:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 17:08:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-05-30 17:08:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:20,922 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:08:20,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 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:08:20,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:20,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:20,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:20,923 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:21,023 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,023 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,024 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,035 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,035 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,035 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,052 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,052 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,053 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,068 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,069 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,069 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,082 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,082 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,082 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,099 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,099 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,099 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,122 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,122 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,122 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,138 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,139 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,139 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,153 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,153 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,154 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,179 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,179 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,194 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,195 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,195 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,205 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,205 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,205 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,261 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:21,262 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:21,262 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:21,269 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 838 states. [2024-05-30 17:08:21,270 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:08:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:21,270 INFO L78 Accepts]: Start accepts. Automaton has currently 922 states, but on-demand construction may add more states Word has length 123 [2024-05-30 17:08:21,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:21,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 17:08:21,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:21,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash 196199955, now seen corresponding path program 1 times [2024-05-30 17:08:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977256204] [2024-05-30 17:08:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:08:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977256204] [2024-05-30 17:08:21,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977256204] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:08:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502580328] [2024-05-30 17:08:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:21,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:21,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:08:21,790 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 17:08:21,792 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 17:08:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:21,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjunts are in the unsatisfiable core [2024-05-30 17:08:21,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:08:22,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-30 17:08:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:08:22,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:08:22,366 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 17:08:22,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-05-30 17:08:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:08:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502580328] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:08:22,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:08:22,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 9] total 17 [2024-05-30 17:08:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946906401] [2024-05-30 17:08:22,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:08:22,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-30 17:08:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:08:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-30 17:08:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-05-30 17:08:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:22,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:08:22,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.058823529411764) internal successors, (222), 17 states have internal predecessors, (222), 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:08:22,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:22,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:22,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:22,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:22,457 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:22,677 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,677 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,677 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,745 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,745 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,745 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,792 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,792 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,792 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,807 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,807 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,807 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,817 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,818 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,818 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,828 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,828 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,828 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,845 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,845 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,845 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,859 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,859 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,859 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,869 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,869 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,869 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,921 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:22,921 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:22,921 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:22,941 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 772 states. [2024-05-30 17:08:22,941 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 17:08:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:08:22,942 INFO L78 Accepts]: Start accepts. Automaton has currently 856 states, but on-demand construction may add more states Word has length 136 [2024-05-30 17:08:22,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:22,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 17:08:23,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:23,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:23,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1796901562, now seen corresponding path program 2 times [2024-05-30 17:08:23,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:23,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420751781] [2024-05-30 17:08:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 17:08:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420751781] [2024-05-30 17:08:23,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420751781] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:08:23,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589489644] [2024-05-30 17:08:23,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 17:08:23,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:23,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:08:23,556 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 17:08:23,576 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 17:08:23,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 17:08:23,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:08:23,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 39 conjunts are in the unsatisfiable core [2024-05-30 17:08:23,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:08:24,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-30 17:08:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 17:08:24,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:08:24,487 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 17:08:24,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-05-30 17:08:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 17:08:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589489644] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:08:25,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:08:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 17] total 41 [2024-05-30 17:08:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374877134] [2024-05-30 17:08:25,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:08:25,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-30 17:08:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:08:25,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-30 17:08:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1484, Unknown=0, NotChecked=0, Total=1640 [2024-05-30 17:08:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:25,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:08:25,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.560975609756097) internal successors, (351), 41 states have internal predecessors, (351), 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:08:25,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:25,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:25,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:25,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:08:25,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:25,300 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:25,980 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:25,980 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:25,980 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:26,546 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:26,546 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:26,546 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 17:08:26,991 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:26,991 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:26,991 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,002 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,002 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,002 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,039 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,039 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:27,039 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,048 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,048 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,048 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,074 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,074 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:27,074 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,087 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,087 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,087 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,105 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,106 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,106 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,121 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,121 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,121 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,137 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,137 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,137 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,153 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,154 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,154 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,168 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,169 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,169 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,186 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,187 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,187 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,208 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,209 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,209 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,225 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,225 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,225 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,239 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,240 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,240 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,255 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:27,255 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,255 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:27,292 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1458 states. [2024-05-30 17:08:27,292 INFO L212 cStratifiedReduction]: Copied states 129 times. [2024-05-30 17:08:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:08:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:08:27,293 INFO L78 Accepts]: Start accepts. Automaton has currently 1480 states, but on-demand construction may add more states Word has length 182 [2024-05-30 17:08:27,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:27,302 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 17:08:27,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:27,503 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:27,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 467350487, now seen corresponding path program 1 times [2024-05-30 17:08:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:27,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213755829] [2024-05-30 17:08:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:08:32,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:32,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213755829] [2024-05-30 17:08:32,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213755829] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:08:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132135207] [2024-05-30 17:08:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:32,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:32,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:08:32,592 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 17:08:32,605 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 17:08:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:32,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 49 conjunts are in the unsatisfiable core [2024-05-30 17:08:32,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:08:33,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:08:33,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2024-05-30 17:08:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 17:08:33,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:08:34,674 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2024-05-30 17:08:34,674 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 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2024-05-30 17:08:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 17:08:34,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132135207] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:08:34,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:08:34,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 25, 17] total 75 [2024-05-30 17:08:34,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579669587] [2024-05-30 17:08:34,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:08:34,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-05-30 17:08:34,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:08:34,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-05-30 17:08:34,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=5283, Unknown=0, NotChecked=0, Total=5550 [2024-05-30 17:08:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:34,900 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:08:34,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 6.453333333333333) internal successors, (484), 75 states have internal predecessors, (484), 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:08:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:34,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:34,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:08:34,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:08:34,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:34,901 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:37,939 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:37,939 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:37,940 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:37,946 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:37,946 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:37,947 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:38,246 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:38,247 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:38,247 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:38,252 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:38,253 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:38,253 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:38,472 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:38,472 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:38,472 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:38,478 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:38,478 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:38,478 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,012 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,013 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:39,013 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,018 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,018 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,019 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,258 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,258 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:39,258 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,266 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,266 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,266 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,277 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,277 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,277 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,286 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,287 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,287 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,297 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,297 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,297 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,311 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,311 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,311 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,321 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,321 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,322 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,330 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,331 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,331 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,341 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:39,341 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,341 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:39,429 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1435 states. [2024-05-30 17:08:39,429 INFO L212 cStratifiedReduction]: Copied states 215 times. [2024-05-30 17:08:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:08:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:08:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:08:39,430 INFO L78 Accepts]: Start accepts. Automaton has currently 1371 states, but on-demand construction may add more states Word has length 203 [2024-05-30 17:08:39,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:08:39,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 17:08:39,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:39,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:08:39,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:08:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 550286147, now seen corresponding path program 2 times [2024-05-30 17:08:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:08:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291210358] [2024-05-30 17:08:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:08:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:08:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:08:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 17:08:40,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:08:40,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291210358] [2024-05-30 17:08:40,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291210358] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:08:40,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511388073] [2024-05-30 17:08:40,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 17:08:40,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:08:40,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:08:40,309 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 17:08:40,333 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 17:08:40,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 17:08:40,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:08:40,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-30 17:08:40,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:08:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 17:08:40,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:08:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-30 17:08:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511388073] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:08:41,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:08:41,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 44 [2024-05-30 17:08:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461655469] [2024-05-30 17:08:41,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:08:41,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-05-30 17:08:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:08:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-05-30 17:08:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2024-05-30 17:08:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:41,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:08:41,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 7.340909090909091) internal successors, (323), 44 states have internal predecessors, (323), 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:08:41,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:41,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:08:41,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:08:41,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:08:41,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:08:41,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:08:41,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:08:41,802 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:08:44,617 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:44,617 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:44,617 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:44,623 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:44,623 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:44,623 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:44,849 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:44,849 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:44,849 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:44,854 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:44,854 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:44,854 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:45,073 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:45,073 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:45,073 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:45,079 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:45,079 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:45,079 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:46,545 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:46,545 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:46,545 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:46,551 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:46,551 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:46,551 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:48,183 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:48,183 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:48,183 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:08:48,190 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:48,190 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:08:48,190 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:08:53,711 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:53,711 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:08:53,711 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:08:53,716 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:53,716 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:08:53,716 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:12,114 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:12,114 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:09:12,115 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:12,122 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:12,123 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:12,123 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,484 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,484 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,484 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,544 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,559 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,559 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,559 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,577 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,578 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,578 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,589 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,589 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,600 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,600 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,600 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,619 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,619 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,619 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,633 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,633 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,633 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,645 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,645 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,645 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,700 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:13,700 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:13,701 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:09:19,516 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2082 states. [2024-05-30 17:09:19,517 INFO L212 cStratifiedReduction]: Copied states 322 times. [2024-05-30 17:09:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:09:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:09:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:09:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:09:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:09:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:09:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-05-30 17:09:19,518 INFO L78 Accepts]: Start accepts. Automaton has currently 1948 states, but on-demand construction may add more states Word has length 241 [2024-05-30 17:09:19,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:09:19,538 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 17:09:19,719 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,SelfDestructingSolverStorable6 [2024-05-30 17:09:19,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:09:19,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:09:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2057885141, now seen corresponding path program 3 times [2024-05-30 17:09:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:09:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701898985] [2024-05-30 17:09:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:09:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:09:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:10:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:10:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:10:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701898985] [2024-05-30 17:10:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701898985] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:10:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2272181] [2024-05-30 17:10:09,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 17:10:09,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:10:09,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:10:09,383 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 17:10:09,385 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 17:10:09,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-30 17:10:09,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:10:09,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 83 conjunts are in the unsatisfiable core [2024-05-30 17:10:09,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:10:11,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-30 17:10:11,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 17:10:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 17:10:14,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:10:14,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 107 [2024-05-30 17:10:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 17:10:14,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:10:21,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 17:10:21,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 156 [2024-05-30 17:10:22,043 INFO L349 Elim1Store]: treesize reduction 5, result has 98.8 percent of original size [2024-05-30 17:10:22,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 302 treesize of output 705 [2024-05-30 17:10:23,101 INFO L349 Elim1Store]: treesize reduction 8, result has 98.1 percent of original size [2024-05-30 17:10:23,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 222 treesize of output 582 [2024-05-30 17:10:24,173 INFO L349 Elim1Store]: treesize reduction 8, result has 98.1 percent of original size [2024-05-30 17:10:24,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 80 treesize of output 501 [2024-05-30 17:12:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-05-30 17:12:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2272181] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:12:38,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:12:38,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 40, 31] total 129 [2024-05-30 17:12:38,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623806450] [2024-05-30 17:12:38,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:12:38,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2024-05-30 17:12:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:12:38,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2024-05-30 17:12:38,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=15802, Unknown=87, NotChecked=0, Total=16512 [2024-05-30 17:12:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:12:38,397 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:12:38,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 5.108527131782946) internal successors, (659), 129 states have internal predecessors, (659), 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:12:38,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:12:38,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:12:38,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:12:38,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:12:38,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:12:38,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:12:38,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-05-30 17:12:38,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:12:38,400 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:12:47,682 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:47,682 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:12:47,682 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:47,687 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:47,687 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:47,687 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:48,522 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:48,522 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:12:48,522 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:48,527 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:48,527 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:48,527 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:49,202 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:49,202 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:12:49,202 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:12:49,207 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:49,207 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:12:49,207 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:12:50,507 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:50,508 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:12:50,508 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:12:50,512 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:50,513 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:12:50,513 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:12:51,248 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:51,249 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:12:51,249 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:51,254 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:51,254 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:51,254 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:53,991 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:53,991 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:12:53,991 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:53,996 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:53,996 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:53,996 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,502 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,502 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:12:54,502 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,509 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,509 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,509 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,524 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,524 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,524 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,533 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,534 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,534 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,543 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,558 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,558 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,559 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,571 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,571 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,571 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,581 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,581 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,581 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,622 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:12:54,623 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,623 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:12:54,897 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1952 states. [2024-05-30 17:12:54,897 INFO L212 cStratifiedReduction]: Copied states 322 times. [2024-05-30 17:12:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:12:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:12:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:12:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:12:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:12:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:12:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-05-30 17:12:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 17:12:54,898 INFO L78 Accepts]: Start accepts. Automaton has currently 1818 states, but on-demand construction may add more states Word has length 262 [2024-05-30 17:12:54,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:12:54,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-30 17:12:55,099 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 17:12:55,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:12:55,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:12:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash 264875303, now seen corresponding path program 4 times [2024-05-30 17:12:55,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:12:55,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877723133] [2024-05-30 17:12:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:12:55,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:12:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:12:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 17:12:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:12:56,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877723133] [2024-05-30 17:12:56,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877723133] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:12:56,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943033732] [2024-05-30 17:12:56,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 17:12:56,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:12:56,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:12:56,388 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 17:12:56,391 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 17:12:56,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 17:12:56,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:12:56,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 48 conjunts are in the unsatisfiable core [2024-05-30 17:12:56,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:12:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 17:12:57,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:13:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 17:13:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943033732] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:13:00,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:13:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 27] total 64 [2024-05-30 17:13:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44488125] [2024-05-30 17:13:00,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:13:00,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-30 17:13:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:13:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-30 17:13:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=3671, Unknown=0, NotChecked=0, Total=4032 [2024-05-30 17:13:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:13:00,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:13:00,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 7.015625) internal successors, (449), 64 states have internal predecessors, (449), 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:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 17:13:00,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:13:00,342 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:13:13,113 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:13,113 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:13:13,113 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:13,118 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:13,118 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:13,118 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:13,705 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:13,705 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:13:13,705 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:13,710 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:13,711 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:13,711 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:14,269 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:14,269 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:13:14,269 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:13:14,274 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:14,274 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:13:14,274 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:13:14,867 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:14,868 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:13:14,868 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:13:14,873 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:14,873 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:13:14,873 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork1_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork1_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:13:15,728 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:15,728 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:13:15,728 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:15,733 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:15,734 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:15,734 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:33,200 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:33,200 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:13:33,200 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:33,205 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:33,205 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:33,205 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:46,513 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 59 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:13:51,866 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:51,867 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:13:51,867 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:51,872 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:13:51,872 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:13:51,872 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:14:35,398 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 85 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:14:52,591 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:14:52,592 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:14:52,592 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:14:52,597 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:14:52,597 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:14:52,597 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:15:35,396 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 83 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:15:37,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:15:39,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:16:03,315 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1544 states. [2024-05-30 17:16:03,315 INFO L212 cStratifiedReduction]: Copied states 368 times. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-05-30 17:16:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 17:16:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-05-30 17:16:03,328 INFO L78 Accepts]: Start accepts. Automaton has currently 1221 states, but on-demand construction may add more states Word has length 313 [2024-05-30 17:16:03,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 17:16:03,337 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 17:16:03,535 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,SelfDestructingSolverStorable8 [2024-05-30 17:16:03,535 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 17:16:03,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 17:16:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1399430868, now seen corresponding path program 5 times [2024-05-30 17:16:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 17:16:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957150935] [2024-05-30 17:16:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 17:16:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 17:16:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 17:16:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 17:16:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 17:16:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957150935] [2024-05-30 17:16:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957150935] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 17:16:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926551693] [2024-05-30 17:16:04,974 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 17:16:04,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:16:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 17:16:04,975 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 17:16:04,976 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 17:16:07,110 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-05-30 17:16:07,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 17:16:07,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 69 conjunts are in the unsatisfiable core [2024-05-30 17:16:07,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 17:16:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 17:16:09,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 17:16:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 17:16:16,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926551693] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 17:16:16,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 17:16:16,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 37] total 101 [2024-05-30 17:16:16,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113391724] [2024-05-30 17:16:16,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 17:16:16,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-05-30 17:16:16,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 17:16:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-05-30 17:16:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=987, Invalid=9113, Unknown=0, NotChecked=0, Total=10100 [2024-05-30 17:16:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:16:16,189 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 17:16:16,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 6.455445544554456) internal successors, (652), 101 states have internal predecessors, (652), 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:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-05-30 17:16:16,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 17:16:16,190 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 17:16:46,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-05-30 17:17:20,218 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 95 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:17:21,846 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:21,846 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:17:21,846 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:21,851 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:21,851 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:21,851 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:25,616 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:25,616 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:17:25,616 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:25,621 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:25,621 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:25,621 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:28,942 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:28,943 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:17:28,943 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:28,947 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:28,948 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:28,948 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:33,982 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:33,983 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:17:33,983 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:33,988 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:33,988 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:33,988 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:37,173 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:37,173 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:17:37,173 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:37,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:37,179 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:37,179 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:40,296 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:40,296 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:17:40,296 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:40,301 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:40,301 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:40,302 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:52,242 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:52,242 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:17:52,243 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:52,248 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:17:52,248 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:17:52,248 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:18:07,169 WARN L293 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 68 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:18:28,157 WARN L293 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 80 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:18:29,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:18:31,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:18:32,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:19:01,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:19:10,186 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:19:10,186 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:19:10,186 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:19:10,192 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:19:10,192 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:19:10,192 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:19:35,193 WARN L293 SmtUtils]: Spent 14.30s on a formula simplification. DAG size of input: 79 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:19:37,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:20:03,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:20:13,031 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:20:13,032 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 17:20:13,032 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:20:13,037 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:20:13,037 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:20:13,037 INFO L395 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork1_#t~post2#1, ~n~0, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_~i~0#1] [2024-05-30 17:20:32,979 WARN L293 SmtUtils]: Spent 10.74s on a formula simplification. DAG size of input: 85 DAG size of output: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:20:53,121 WARN L293 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 79 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:21:24,578 WARN L293 SmtUtils]: Spent 10.60s on a formula simplification. DAG size of input: 101 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 17:21:27,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 17:21:58,060 WARN L293 SmtUtils]: Spent 13.30s on a formula simplification. DAG size of input: 97 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-30 17:22:15,856 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:22:15,856 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:22:15,856 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 17:22:16,428 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1688 states. [2024-05-30 17:22:16,429 INFO L212 cStratifiedReduction]: Copied states 414 times. [2024-05-30 17:22:16,435 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 17:22:16,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:22:16,629 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. [2024-05-30 17:22:16,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 17:22:16,644 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2024-05-30 17:22:16,645 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-30 17:22:16,646 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 17:22:16,646 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 17:22:16,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 05:22:16 BasicIcfg [2024-05-30 17:22:16,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 17:22:16,648 INFO L158 Benchmark]: Toolchain (without parser) took 838860.93ms. Allocated memory was 163.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 95.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 542.6MB. Max. memory is 8.0GB. [2024-05-30 17:22:16,648 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 17:22:16,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.19ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 83.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 17:22:16,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.08ms. Allocated memory is still 163.6MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:22:16,648 INFO L158 Benchmark]: Boogie Preprocessor took 20.93ms. Allocated memory is still 163.6MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:22:16,649 INFO L158 Benchmark]: RCFGBuilder took 423.02ms. Allocated memory was 163.6MB in the beginning and 273.7MB in the end (delta: 110.1MB). Free memory was 79.4MB in the beginning and 235.9MB in the end (delta: -156.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2024-05-30 17:22:16,649 INFO L158 Benchmark]: TraceAbstraction took 838183.18ms. Allocated memory was 273.7MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 234.4MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 572.5MB. Max. memory is 8.0GB. [2024-05-30 17:22:16,650 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.19ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 83.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.08ms. Allocated memory is still 163.6MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.93ms. Allocated memory is still 163.6MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 423.02ms. Allocated memory was 163.6MB in the beginning and 273.7MB in the end (delta: 110.1MB). Free memory was 79.4MB in the beginning and 235.9MB in the end (delta: -156.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * TraceAbstraction took 838183.18ms. Allocated memory was 273.7MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 234.4MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 572.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12636, independent: 11273, independent conditional: 11273, independent unconditional: 0, dependent: 1363, dependent conditional: 1363, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11273, independent: 11273, independent conditional: 11273, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11273, independent: 11273, independent conditional: 11273, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11273, independent: 11273, independent conditional: 0, independent unconditional: 11273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11273, independent: 11273, independent conditional: 0, independent unconditional: 11273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11273, independent: 11273, independent conditional: 0, independent unconditional: 11273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11273, independent: 11273, independent conditional: 0, independent unconditional: 11273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11273, independent: 11273, independent conditional: 0, independent unconditional: 11273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11273, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11273, unknown conditional: 0, unknown unconditional: 11273] , Statistics on independence cache: Total cache size (in pairs): 11273, Positive cache size: 11273, Positive conditional cache size: 0, Positive unconditional cache size: 11273, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1363 - StatisticsResult: Reduction benchmarks 33.4ms Time before loop, 641.7ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 744, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 10.2ms Time before loop, 247.0ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 807, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 8.6ms Time before loop, 324.0ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 830, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 57.3ms Time before loop, 289.3ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 838, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 84.2ms Time before loop, 399.3ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 13, Reduction States: 772, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 452.1ms Time before loop, 1540.0ms Time in loop, 2.0s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 21, Reduction States: 1458, Duplicate States: 129, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 2208.2ms Time before loop, 2320.2ms Time in loop, 4.5s Time in total, Has Loop: 1, wrong guesses: 5, overall guesses: 20, Reduction States: 1435, Duplicate States: 215, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 2464.0ms Time before loop, 35250.4ms Time in loop, 37.7s Time in total, Has Loop: 1, wrong guesses: 7, overall guesses: 27, Reduction States: 2082, Duplicate States: 322, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 6998.1ms Time before loop, 9498.9ms Time in loop, 16.5s Time in total, Has Loop: 1, wrong guesses: 7, overall guesses: 24, Reduction States: 1952, Duplicate States: 322, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 5346.7ms Time before loop, 177625.8ms Time in loop, 183.0s Time in total, Has Loop: 1, wrong guesses: 8, overall guesses: 19, Reduction States: 1544, Duplicate States: 368, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 30758.7ms Time before loop, 329480.0ms Time in loop, 360.2s Time in total, Has Loop: 1, wrong guesses: 9, overall guesses: 19, Reduction States: 1688, Duplicate States: 414, Protected Variables: 6 - StatisticsResult: Visitor Statistics States: 726, Transitions: 809, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 726, Transitions: 814, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 739, Transitions: 828, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 746, Transitions: 835, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 678, Transitions: 758, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 1334, Transitions: 1514, Traversal time: 2.0s - StatisticsResult: Visitor Statistics States: 1308, Transitions: 1480, Traversal time: 4.5s - StatisticsResult: Visitor Statistics States: 1901, Transitions: 2133, Traversal time: 37.7s - StatisticsResult: Visitor Statistics States: 1771, Transitions: 1983, Traversal time: 16.5s - StatisticsResult: Visitor Statistics States: 1379, Transitions: 1534, Traversal time: 183.0s - StatisticsResult: Visitor Statistics States: 1515, Transitions: 1694, Traversal time: 360.2s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 39, RedundantProofs: 8, ProvenStates: 1178, Times there's more than one choice: 1041, Avg number of choices: 5.997453310696095 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 230 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 838.0s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 606.1s, 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: 591, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 226.1s InterpolantComputationTime, 3244 NumberOfCodeBlocks, 3244 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4680 ConstructedInterpolants, 21 QuantifiedInterpolants, 79425 SizeOfPredicates, 185 NumberOfNonLiveVariables, 2683 ConjunctsInSsa, 347 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 430/3457 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