/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-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 05:37:28,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 05:37:28,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 05:37:28,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 05:37:28,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 05:37:28,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 05:37:28,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 05:37:28,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 05:37:28,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 05:37:28,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 05:37:28,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 05:37:28,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 05:37:28,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 05:37:28,326 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 05:37:28,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 05:37:28,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 05:37:28,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 05:37:28,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 05:37:28,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 05:37:28,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 05:37:28,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 05:37:28,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 05:37:28,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 05:37:28,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 05:37:28,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 05:37:28,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 05:37:28,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 05:37:28,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 05:37:28,329 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 05:37:28,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 05:37:28,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:37:28,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 05:37:28,331 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 05:37:28,332 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-03 05:37:28,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 05:37:28,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 05:37:28,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 05:37:28,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 05:37:28,554 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 05:37:28,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-03 05:37:29,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 05:37:29,719 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 05:37:29,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-03 05:37:29,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/414e5a3f8/21ae372b6d5040acacda7a6f75348e01/FLAGdf939b81d [2024-05-03 05:37:29,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/414e5a3f8/21ae372b6d5040acacda7a6f75348e01 [2024-05-03 05:37:29,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 05:37:29,746 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 05:37:29,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 05:37:29,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 05:37:29,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 05:37:29,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:29,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7801dfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29, skipping insertion in model container [2024-05-03 05:37:29,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:29,768 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 05:37:29,897 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-3.wvr.c[2500,2513] [2024-05-03 05:37:29,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:37:29,911 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 05:37:29,925 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-3.wvr.c[2500,2513] [2024-05-03 05:37:29,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:37:29,945 INFO L206 MainTranslator]: Completed translation [2024-05-03 05:37:29,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29 WrapperNode [2024-05-03 05:37:29,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 05:37:29,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 05:37:29,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 05:37:29,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 05:37:29,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:29,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,019 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 147 [2024-05-03 05:37:30,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 05:37:30,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 05:37:30,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 05:37:30,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 05:37:30,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 05:37:30,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 05:37:30,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 05:37:30,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 05:37:30,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (1/1) ... [2024-05-03 05:37:30,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:37:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:37:30,103 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-03 05:37:30,124 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-03 05:37:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 05:37:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 05:37:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 05:37:30,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 05:37:30,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 05:37:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 05:37:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 05:37:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 05:37:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 05:37:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 05:37:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 05:37:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 05:37:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 05:37:30,146 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 05:37:30,239 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 05:37:30,241 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 05:37:30,464 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 05:37:30,477 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 05:37:30,477 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-03 05:37:30,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:37:30 BoogieIcfgContainer [2024-05-03 05:37:30,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 05:37:30,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 05:37:30,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 05:37:30,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 05:37:30,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 05:37:29" (1/3) ... [2024-05-03 05:37:30,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787eb138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:37:30, skipping insertion in model container [2024-05-03 05:37:30,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:37:29" (2/3) ... [2024-05-03 05:37:30,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787eb138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:37:30, skipping insertion in model container [2024-05-03 05:37:30,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:37:30" (3/3) ... [2024-05-03 05:37:30,484 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-05-03 05:37:30,493 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 05:37:30,500 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 05:37:30,501 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 05:37:30,501 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 05:37:30,578 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 05:37:30,608 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:37:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:37:30,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:37:30,611 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-03 05:37:30,613 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-03 05:37:30,641 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:37:30,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 05:37:30,652 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;@3aa1bde8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:37:30,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:37:30,657 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:37:30,769 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:30,770 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:30,770 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:30,844 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:30,845 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:30,845 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:30,889 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:30,890 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:30,890 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:30,922 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:30,922 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:30,923 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:30,956 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:30,956 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:30,956 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,009 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,010 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,010 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,050 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,050 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,050 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,086 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,087 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,087 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,116 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,117 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,117 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,152 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,152 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,152 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,174 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,174 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,174 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,190 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,190 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,191 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,275 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,275 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,275 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,280 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 737 states. [2024-05-03 05:37:31,280 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:37:31,282 INFO L78 Accepts]: Start accepts. Automaton has currently 780 states, but on-demand construction may add more states Word has length 100 [2024-05-03 05:37:31,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:37:31,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:37:31,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:37:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1566695842, now seen corresponding path program 1 times [2024-05-03 05:37:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:37:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291952364] [2024-05-03 05:37:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:37:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:31,529 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-03 05:37:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:37:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291952364] [2024-05-03 05:37:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291952364] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:37:31,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:37:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 05:37:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467970007] [2024-05-03 05:37:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:37:31,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 05:37:31,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:37:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 05:37:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 05:37:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:31,560 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:37:31,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 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-03 05:37:31,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:31,562 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:37:31,593 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,593 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,593 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,621 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,621 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,621 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,635 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,636 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,636 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,649 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,650 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,650 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,659 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,660 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,660 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,672 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,673 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,673 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,692 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,692 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,692 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,702 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,702 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,703 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,712 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,713 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,713 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,732 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,732 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,732 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,745 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,746 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,746 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,756 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,756 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,756 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,886 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:31,887 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:31,888 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:31,896 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 801 states. [2024-05-03 05:37:31,896 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:37:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:31,897 INFO L78 Accepts]: Start accepts. Automaton has currently 883 states, but on-demand construction may add more states Word has length 95 [2024-05-03 05:37:31,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:37:31,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 05:37:31,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:37:31,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:37:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1119003591, now seen corresponding path program 1 times [2024-05-03 05:37:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:37:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179197949] [2024-05-03 05:37:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:37:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:32,259 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-03 05:37:32,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:37:32,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179197949] [2024-05-03 05:37:32,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179197949] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:37:32,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:37:32,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 05:37:32,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171484513] [2024-05-03 05:37:32,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:37:32,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 05:37:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:37:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 05:37:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-03 05:37:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:32,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:37:32,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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-03 05:37:32,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:32,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:32,263 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:37:32,391 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,391 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,391 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,401 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,401 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,401 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,414 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,414 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,414 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,426 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,426 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,427 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,436 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,438 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,439 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,452 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,452 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,452 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,467 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,467 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,467 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,476 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,477 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,477 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,514 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,515 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,515 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,532 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,532 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,532 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,544 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,544 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,544 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,554 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,554 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,554 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,604 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,604 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,604 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,612 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 809 states. [2024-05-03 05:37:32,612 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:37:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:32,613 INFO L78 Accepts]: Start accepts. Automaton has currently 891 states, but on-demand construction may add more states Word has length 103 [2024-05-03 05:37:32,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:37:32,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 05:37:32,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:37:32,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:37:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash -688973404, now seen corresponding path program 1 times [2024-05-03 05:37:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:37:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274773504] [2024-05-03 05:37:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:37:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:32,817 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-03 05:37:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:37:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274773504] [2024-05-03 05:37:32,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274773504] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:37:32,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:37:32,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 05:37:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513892055] [2024-05-03 05:37:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:37:32,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 05:37:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:37:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 05:37:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-03 05:37:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:32,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:37:32,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-03 05:37:32,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:32,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:32,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:32,820 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:37:32,898 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,898 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,898 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,914 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,914 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,914 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,950 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,950 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,950 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,966 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,966 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,966 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,977 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,977 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,977 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:32,988 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:32,988 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:32,988 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:33,008 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,009 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:33,009 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:33,022 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,023 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:33,023 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:33,033 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,033 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:33,033 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:33,083 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,083 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:33,083 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:33,096 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 701 states. [2024-05-03 05:37:33,096 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:37:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:37:33,096 INFO L78 Accepts]: Start accepts. Automaton has currently 783 states, but on-demand construction may add more states Word has length 116 [2024-05-03 05:37:33,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:37:33,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 05:37:33,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:37:33,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:37:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1997832491, now seen corresponding path program 1 times [2024-05-03 05:37:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:37:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540571217] [2024-05-03 05:37:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:37:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:33,210 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-03 05:37:33,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:37:33,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540571217] [2024-05-03 05:37:33,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540571217] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:37:33,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190953632] [2024-05-03 05:37:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:33,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:37:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:37:33,246 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-03 05:37:33,250 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-03 05:37:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:33,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-03 05:37:33,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:37:33,394 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-03 05:37:33,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:37:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 05:37:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190953632] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-03 05:37:33,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-03 05:37:33,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2024-05-03 05:37:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387964595] [2024-05-03 05:37:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:37:33,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-03 05:37:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:37:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-03 05:37:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-05-03 05:37:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:33,470 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:37:33,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-03 05:37:33,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:33,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:33,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:37:33,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:33,471 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:37:33,523 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,523 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:33,523 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:37:33,537 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,537 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:33,537 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,548 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,550 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,550 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,563 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,563 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:33,564 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,576 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,577 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,577 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,593 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,593 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,593 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,603 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,603 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,603 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,612 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,612 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,612 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,629 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,629 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,629 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,641 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,642 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,642 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,651 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,651 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,651 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,700 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:33,700 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,700 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:33,706 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 803 states. [2024-05-03 05:37:33,707 INFO L212 cStratifiedReduction]: Copied states 84 times. [2024-05-03 05:37:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:37:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:37:33,707 INFO L78 Accepts]: Start accepts. Automaton has currently 802 states, but on-demand construction may add more states Word has length 153 [2024-05-03 05:37:33,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:37:33,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-03 05:37:33,914 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-03 05:37:33,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:37:33,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:37:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash 783855516, now seen corresponding path program 1 times [2024-05-03 05:37:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:37:33,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181972264] [2024-05-03 05:37:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:37:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 05:37:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:37:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181972264] [2024-05-03 05:37:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181972264] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:37:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554249188] [2024-05-03 05:37:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:37:34,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:37:34,331 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-03 05:37:34,356 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-03 05:37:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:34,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-03 05:37:34,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:37:34,963 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-03 05:37:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:37:35,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:37:35,479 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:37:35,479 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-03 05:37:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:37:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554249188] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:37:36,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:37:36,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2024-05-03 05:37:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613540380] [2024-05-03 05:37:36,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:37:36,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-03 05:37:36,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:37:36,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-03 05:37:36,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2024-05-03 05:37:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:36,102 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:37:36,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.222222222222221) internal successors, (404), 36 states have internal predecessors, (404), 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-03 05:37:36,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:36,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:36,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:37:36,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:37:36,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:36,102 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:37:37,075 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,075 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:37,076 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,083 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,084 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,084 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,327 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,327 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:37,329 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,337 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,337 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,337 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,385 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,385 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:37,385 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,393 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,393 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,393 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,410 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,410 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:37,410 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,433 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,433 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,433 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,452 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,452 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,452 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,463 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,463 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,463 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,482 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,482 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,482 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,505 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,505 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,506 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,516 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,516 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,516 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,526 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,526 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,526 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,543 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,544 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,544 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,556 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,556 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,557 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,565 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,566 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,566 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,611 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:37,611 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,611 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:37,697 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1119 states. [2024-05-03 05:37:37,697 INFO L212 cStratifiedReduction]: Copied states 168 times. [2024-05-03 05:37:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:37:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:37:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:37:37,697 INFO L78 Accepts]: Start accepts. Automaton has currently 1037 states, but on-demand construction may add more states Word has length 174 [2024-05-03 05:37:37,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:37:37,704 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-03 05:37:37,903 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-03 05:37:37,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:37:37,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:37:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash -569130302, now seen corresponding path program 2 times [2024-05-03 05:37:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:37:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447310036] [2024-05-03 05:37:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:37,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:37:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-03 05:37:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:37:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447310036] [2024-05-03 05:37:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447310036] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:37:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734703466] [2024-05-03 05:37:38,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:37:38,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:37:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:37:38,521 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-03 05:37:38,525 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-03 05:37:38,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:37:38,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:37:38,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-03 05:37:38,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:37:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-03 05:37:39,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:37:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-03 05:37:39,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734703466] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:37:39,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:37:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2024-05-03 05:37:39,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121792782] [2024-05-03 05:37:39,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:37:39,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-03 05:37:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:37:39,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-03 05:37:39,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2024-05-03 05:37:39,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:39,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:37:39,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.166666666666666) internal successors, (245), 30 states have internal predecessors, (245), 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-03 05:37:39,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:39,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:39,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:37:39,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:37:39,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:37:39,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:39,987 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:37:40,468 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,468 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:40,469 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,475 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,475 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,475 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,565 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,565 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:40,565 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,573 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,573 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,573 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,683 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,683 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:40,683 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,691 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:40,691 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:40,691 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:41,684 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:41,684 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:41,684 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:41,692 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:41,692 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:41,692 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:42,136 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:42,137 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:37:42,137 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:42,145 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:37:42,145 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:42,145 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:37:42,375 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 782 states. [2024-05-03 05:37:42,375 INFO L212 cStratifiedReduction]: Copied states 210 times. [2024-05-03 05:37:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:37:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:37:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:37:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:37:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:37:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-03 05:37:42,376 INFO L78 Accepts]: Start accepts. Automaton has currently 616 states, but on-demand construction may add more states Word has length 213 [2024-05-03 05:37:42,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:37:42,385 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-03 05:37:42,577 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-03 05:37:42,578 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:37:42,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:37:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1095653113, now seen corresponding path program 3 times [2024-05-03 05:37:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:37:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472595419] [2024-05-03 05:37:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:37:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:37:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:37:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-03 05:37:43,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:37:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472595419] [2024-05-03 05:37:43,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472595419] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:37:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557515246] [2024-05-03 05:37:43,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:37:43,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:37:43,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:37:43,082 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-03 05:37:43,105 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-03 05:37:43,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-03 05:37:43,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:37:43,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 91 conjunts are in the unsatisfiable core [2024-05-03 05:37:43,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:37:44,214 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-03 05:37:44,670 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-03 05:37:44,745 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-03 05:37:47,453 INFO L349 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2024-05-03 05:37:47,453 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 165 treesize of output 88 [2024-05-03 05:37:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:37:47,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:37:53,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:37:53,767 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 704 treesize of output 404 [2024-05-03 05:37:53,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:37:53,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 2052 treesize of output 1956 [2024-05-03 05:37:54,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:37:54,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 465 treesize of output 473 [2024-05-03 05:38:00,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:38:00,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 316 treesize of output 480 [2024-05-03 05:38:37,015 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 05:38:46,396 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 05:39:00,037 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 05:39:45,854 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 05:39:46,774 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 05:39:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:39:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557515246] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:39:53,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:39:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 48, 44] total 103 [2024-05-03 05:39:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669860667] [2024-05-03 05:39:53,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:39:53,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-05-03 05:39:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:39:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-05-03 05:39:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=9918, Unknown=56, NotChecked=0, Total=10506 [2024-05-03 05:39:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:53,811 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:39:53,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 5.87378640776699) internal successors, (605), 103 states have internal predecessors, (605), 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-03 05:39:53,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:53,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:39:53,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:39:53,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:39:53,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:39:53,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-03 05:39:53,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:53,812 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:39:59,336 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,337 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,337 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:39:59,342 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,342 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:39:59,342 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:01,229 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,229 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,229 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:01,235 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,235 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:01,235 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:02,995 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:02,995 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:02,995 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:03,000 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:03,001 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:03,001 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:07,908 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:07,908 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:07,908 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:07,913 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:07,914 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:07,914 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:09,928 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:09,928 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:09,928 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:09,935 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:09,936 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:09,936 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:10,197 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 943 states. [2024-05-03 05:40:10,197 INFO L212 cStratifiedReduction]: Copied states 210 times. [2024-05-03 05:40:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:40:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:40:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:40:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-03 05:40:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-03 05:40:10,205 INFO L78 Accepts]: Start accepts. Automaton has currently 777 states, but on-demand construction may add more states Word has length 258 [2024-05-03 05:40:10,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:40:10,215 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-03 05:40:10,411 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-03 05:40:10,412 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:40:10,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:40:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash -609926049, now seen corresponding path program 4 times [2024-05-03 05:40:10,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:40:10,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922943877] [2024-05-03 05:40:10,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:40:10,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:40:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:40:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-05-03 05:40:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:40:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922943877] [2024-05-03 05:40:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922943877] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:40:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621275694] [2024-05-03 05:40:16,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 05:40:16,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:40:16,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:40:16,880 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-03 05:40:16,881 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-03 05:40:17,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 05:40:17,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:40:17,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 30 conjunts are in the unsatisfiable core [2024-05-03 05:40:17,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:40:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-05-03 05:40:23,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:40:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-05-03 05:40:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621275694] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:40:29,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:40:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 47 [2024-05-03 05:40:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492078408] [2024-05-03 05:40:29,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:40:29,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-05-03 05:40:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:40:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-05-03 05:40:29,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1860, Unknown=2, NotChecked=0, Total=2162 [2024-05-03 05:40:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:29,066 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:40:29,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.51063829787234) internal successors, (353), 47 states have internal predecessors, (353), 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-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-03 05:40:29,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:29,067 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:40:40,467 WARN L293 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 74 DAG size of output: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:40:47,391 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:47,392 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:47,392 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:47,397 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:47,397 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:47,397 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:40:47,953 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:47,953 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:47,953 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:47,959 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:47,959 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:47,959 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:40:53,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:40:56,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:40:57,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:41:00,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:41:02,007 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-03 05:41:04,153 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-03 05:41:06,772 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-03 05:41:06,962 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:06,962 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:41:06,962 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:41:06,968 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:06,968 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:41:06,968 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:41:07,597 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:07,597 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:41:07,597 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:41:07,602 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:07,602 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:41:07,602 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:41:07,784 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:07,784 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:41:07,785 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:07,789 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:07,790 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:07,790 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:08,220 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:08,220 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:41:08,220 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:08,225 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:08,225 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:08,225 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:27,577 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:27,578 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:41:27,578 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:27,583 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:27,583 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:27,584 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:37,647 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-03 05:41:43,186 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:43,186 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:41:43,186 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:43,191 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:43,191 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:43,191 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:50,625 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:50,625 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:41:50,625 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:50,630 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:41:50,630 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:41:50,630 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:02,903 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:02,904 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:02,904 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:02,909 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:02,909 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:02,909 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:07,423 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:07,424 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:07,424 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:07,430 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:07,430 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:07,430 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:42:07,839 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1875 states. [2024-05-03 05:42:07,839 INFO L212 cStratifiedReduction]: Copied states 462 times. [2024-05-03 05:42:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:42:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:42:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:42:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:42:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:42:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-03 05:42:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-03 05:42:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:42:07,840 INFO L78 Accepts]: Start accepts. Automaton has currently 1457 states, but on-demand construction may add more states Word has length 336 [2024-05-03 05:42:07,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:42:07,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-03 05:42:08,042 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-03 05:42:08,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:42:08,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:42:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1316853759, now seen corresponding path program 5 times [2024-05-03 05:42:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:42:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62372737] [2024-05-03 05:42:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:42:08,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:42:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:42:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-05-03 05:42:09,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:42:09,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62372737] [2024-05-03 05:42:09,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62372737] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:42:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128102754] [2024-05-03 05:42:09,199 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 05:42:09,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:42:09,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:42:09,200 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-03 05:42:09,202 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-03 05:42:24,092 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-05-03 05:42:24,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:42:24,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-03 05:42:24,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:42:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 635 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-05-03 05:42:24,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:42:27,533 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) is different from false [2024-05-03 05:45:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 557 refuted. 57 times theorem prover too weak. 157 trivial. 21 not checked. [2024-05-03 05:45:13,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128102754] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:45:13,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:45:13,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 56 [2024-05-03 05:45:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53695217] [2024-05-03 05:45:13,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:45:13,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-05-03 05:45:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:45:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-05-03 05:45:13,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2693, Unknown=73, NotChecked=106, Total=3080 [2024-05-03 05:45:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:45:13,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:45:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 7.803571428571429) internal successors, (437), 56 states have internal predecessors, (437), 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-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:45:13,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:45:13,479 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:45:13,753 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:13,753 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:13,753 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:13,757 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:13,757 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:13,757 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:14,082 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,083 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:14,083 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,088 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,088 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,088 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,366 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,366 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:14,367 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,371 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,371 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,371 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,624 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,624 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:14,624 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,629 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,629 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,629 INFO L370 cStratifiedReduction]: Actual level: [~n~0, thread2Thread1of1ForFork1_~i~1#1] [2024-05-03 05:45:14,881 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,881 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:14,881 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:14,886 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:14,886 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:14,886 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:15,144 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:15,144 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:15,144 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:15,149 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:15,149 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:15,149 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:16,493 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:16,494 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:45:16,494 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:16,498 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:45:16,498 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:45:16,498 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:46:27,855 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 [1] [2024-05-03 05:46:29,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:31,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:33,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:35,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:37,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:39,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:41,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:43,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:45,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:48,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:50,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:52,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:54,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:46:56,046 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 [1] [2024-05-03 05:46:58,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:00,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:02,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:04,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:06,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:08,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:10,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:12,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:14,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:16,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:18,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:20,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:22,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:24,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:26,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:28,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:30,406 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 [1] [2024-05-03 05:47:32,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:34,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:36,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:38,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:40,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:42,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:44,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:46,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:48,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:50,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:52,579 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse6 (* 8589934593 v_z_2))) (< (+ (* (div .cse6 4294967296) 4294967296) 6) .cse6)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse7 (* 8589934593 v_z_2))) (< (+ (* (div .cse7 4294967296) 4294967296) 6) .cse7)) (< v_z_2 (+ (mod (+ 6 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse8 (* 8589934593 v_z_2))) (< (+ (* (div .cse8 4294967296) 4294967296) 6) .cse8)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (< 4294967295 v_z_2) (let ((.cse9 (* 8589934593 v_z_2))) (< (+ (* (div .cse9 4294967296) 4294967296) 6) .cse9)))) (let ((.cse10 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse10 4294967296) 4294967296)) .cse10)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse11 (* 8589934593 v_z_2))) (< (+ (* (div .cse11 4294967296) 4294967296) 6) .cse11)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse12 (* 8589934593 v_z_2))) (< (+ (* (div .cse12 4294967296) 4294967296) 6) .cse12)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 05:47:54,589 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 [1] [2024-05-03 05:47:56,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:47:58,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:00,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:02,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:04,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:06,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:08,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:10,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:12,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:14,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:16,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:18,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:20,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:22,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:48:24,795 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 [1] [2024-05-03 05:48:26,822 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 [1] [2024-05-03 05:48:28,834 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 [1] [2024-05-03 05:48:30,840 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 [1] [2024-05-03 05:48:32,872 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 c_~n~0))) (let ((.cse0 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse5 (+ 7 (* (div .cse6 4294967296) 4294967296)))) (and (<= .cse0 0) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (= 6 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)))) (<= .cse5 (+ .cse6 (* .cse0 4294967296))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse7 (* 8589934593 v_z_2))) (< (+ (* (div .cse7 4294967296) 4294967296) 6) .cse7)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse8 (* 8589934593 v_z_2))) (< (+ (* (div .cse8 4294967296) 4294967296) 6) .cse8)) (< v_z_2 (+ (mod (+ 6 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (<= .cse5 .cse6)))) is different from false [2024-05-03 05:48:34,888 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse4 4294967296) 4294967296)) .cse4)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse6 (* 8589934593 v_z_2))) (< (+ (* (div .cse6 4294967296) 4294967296) 6) .cse6)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 05:48:36,907 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 05:48:36,925 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:36,925 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:48:36,925 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:36,930 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:36,930 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:36,930 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:38,958 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse5 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse5 4294967296) 4294967296)) .cse5))) is different from false [2024-05-03 05:48:40,970 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 05:48:42,990 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 05:48:43,003 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:43,003 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:48:43,003 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:43,008 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:43,008 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:43,008 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:45,033 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2024-05-03 05:48:47,069 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-05-03 05:48:49,078 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-05-03 05:48:49,090 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:49,090 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:48:49,090 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:49,094 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:49,094 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:49,094 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:51,124 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-05-03 05:48:53,471 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-05-03 05:48:55,486 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2024-05-03 05:48:55,498 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:55,498 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:48:55,498 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:55,503 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:55,503 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:48:55,503 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, 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, thread1Thread1of1ForFork0_#t~mem1#1, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~ret11#1.offset, ~f~0.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-03 05:50:13,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:15,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:17,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:19,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:21,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:23,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:25,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:27,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:30,231 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 [1] [2024-05-03 05:50:31,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:33,306 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 [1] [2024-05-03 05:50:35,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:37,318 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 [1] [2024-05-03 05:50:39,385 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 [1] [2024-05-03 05:50:41,390 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 [1] [2024-05-03 05:50:43,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:45,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:47,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:49,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:51,799 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 [1] [2024-05-03 05:50:53,804 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 [1] [2024-05-03 05:50:55,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:50:57,911 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 [1] [2024-05-03 05:50:59,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:51:02,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:51:04,655 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 [1] [2024-05-03 05:51:06,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 05:51:08,670 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 [1] [2024-05-03 05:51:10,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-05-03 05:51:50,079 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-03 05:51:50,079 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-03 05:51:50,079 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 05:51:51,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-03 05:51:51,093 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-03 05:51:51,170 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1813 states. [2024-05-03 05:51:51,170 INFO L212 cStratifiedReduction]: Copied states 462 times. [2024-05-03 05:51:51,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-03 05:51:51,170 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-03 05:51:51,172 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 05:51:51,181 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-05-03 05:51:51,182 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-03 05:51:51,183 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 05:51:51,183 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 05:51:51,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 05:51:51 BasicIcfg [2024-05-03 05:51:51,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 05:51:51,201 INFO L158 Benchmark]: Toolchain (without parser) took 861455.49ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 96.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 223.7MB. Max. memory is 8.0GB. [2024-05-03 05:51:51,201 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 05:51:51,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.64ms. Allocated memory is still 159.4MB. Free memory was 96.1MB in the beginning and 84.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-03 05:51:51,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.93ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 135.9MB in the end (delta: -51.9MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2024-05-03 05:51:51,207 INFO L158 Benchmark]: Boogie Preprocessor took 26.08ms. Allocated memory is still 159.4MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 05:51:51,207 INFO L158 Benchmark]: RCFGBuilder took 430.27ms. Allocated memory is still 159.4MB. Free memory was 134.3MB in the beginning and 116.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-05-03 05:51:51,207 INFO L158 Benchmark]: TraceAbstraction took 860721.25ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 115.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 242.5MB. Max. memory is 8.0GB. [2024-05-03 05:51:51,214 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.13ms. Allocated memory is still 159.4MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.64ms. Allocated memory is still 159.4MB. Free memory was 96.1MB in the beginning and 84.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.93ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 135.9MB in the end (delta: -51.9MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.08ms. Allocated memory is still 159.4MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 430.27ms. Allocated memory is still 159.4MB. Free memory was 134.3MB in the beginning and 116.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 860721.25ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 115.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 242.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: 8098, independent: 7347, independent conditional: 7347, independent unconditional: 0, dependent: 751, dependent conditional: 751, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7347, independent: 7347, independent conditional: 7347, 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: 7347, independent: 7347, independent conditional: 7347, 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: 7347, independent: 7347, independent conditional: 0, independent unconditional: 7347, 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: 7347, independent: 7347, independent conditional: 0, independent unconditional: 7347, 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: 7347, independent: 7347, independent conditional: 0, independent unconditional: 7347, 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: 7347, independent: 7347, independent conditional: 0, independent unconditional: 7347, 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: 7347, independent: 7347, independent conditional: 0, independent unconditional: 7347, 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: 7347, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7347, unknown conditional: 0, unknown unconditional: 7347] , Statistics on independence cache: Total cache size (in pairs): 7347, Positive cache size: 7347, Positive conditional cache size: 0, Positive unconditional cache size: 7347, 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: 751 - StatisticsResult: Reduction benchmarks 14.3ms Time before loop, 607.8ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 737, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 11.9ms Time before loop, 321.2ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 801, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 94.5ms Time before loop, 253.8ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 809, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 36.4ms Time before loop, 239.5ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 13, Reduction States: 701, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 5.1ms Time before loop, 230.4ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 803, Duplicate States: 84, Protected Variables: 2 - StatisticsResult: Reduction benchmarks 453.2ms Time before loop, 1140.8ms Time in loop, 1.6s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 21, Reduction States: 1119, Duplicate States: 168, Protected Variables: 2 - StatisticsResult: Reduction benchmarks 218.4ms Time before loop, 2168.7ms Time in loop, 2.4s Time in total, Has Loop: 1, wrong guesses: 5, overall guesses: 13, Reduction States: 782, Duplicate States: 210, Protected Variables: 2 - StatisticsResult: Reduction benchmarks 4070.6ms Time before loop, 12313.8ms Time in loop, 16.4s Time in total, Has Loop: 1, wrong guesses: 5, overall guesses: 13, Reduction States: 943, Duplicate States: 210, Protected Variables: 38 - StatisticsResult: Reduction benchmarks 11852.2ms Time before loop, 86919.3ms Time in loop, 98.8s Time in total, Has Loop: 1, wrong guesses: 11, overall guesses: 25, Reduction States: 1875, Duplicate States: 462, Protected Variables: 38 - StatisticsResult: Reduction benchmarks 24.6ms Time before loop, 397666.1ms Time in loop, 397.7s Time in total, Has Loop: 1, wrong guesses: 11, overall guesses: 23, Reduction States: 1813, Duplicate States: 462, Protected Variables: 38 - StatisticsResult: Visitor Statistics States: 719, Transitions: 790, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 719, Transitions: 795, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 726, Transitions: 802, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 620, Transitions: 684, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 711, Transitions: 804, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 996, Transitions: 1128, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 672, Transitions: 748, Traversal time: 2.4s - StatisticsResult: Visitor Statistics States: 827, Transitions: 919, Traversal time: 16.4s - StatisticsResult: Visitor Statistics States: 1667, Transitions: 1867, Traversal time: 98.8s - StatisticsResult: Visitor Statistics States: 1616, Transitions: 1814, Traversal time: 397.7s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 31, RedundantProofs: 6, ProvenStates: 860, Times there's more than one choice: 743, Avg number of choices: 5.4837209302325585 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 235 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 860.6s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 518.7s, 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: 320, 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.1s SsaConstructionTime, 16.2s SatisfiabilityAnalysisTime, 323.9s InterpolantComputationTime, 2798 NumberOfCodeBlocks, 2798 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4027 ConstructedInterpolants, 144 QuantifiedInterpolants, 59965 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2288 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 679/3511 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